-
✓ Lock all 21 design questions (DECISIONS-LOCKED.md)
-
✓ Write EBNF grammars (tangle.ebnf, tangle-jtv.ebnf)
-
✓ Write formal typing rules (37+ rules)
-
✓ Write operational semantics (26+ evaluation rules)
-
✓ Define precedence table
-
✓ Cross-verify grammar vs formal semantics
-
✓ Create implementation plan (SONNET-TASKS.md)
-
✓ Update all documentation
-
❏ Lexer with mode switching (TANGLE / HV_DATA / HV_CONTROL)
-
❏ TANGLE recursive-descent parser
-
❏ TANGLE-JTV parser extensions (add{}, harvard{})
-
❏ AST pretty-printer
-
❏ Parser error recovery with source spans
-
❏ Parser test suite
-
❏ TANGLE core type checker (Word[n], Tangle[A,B], Num, Str, Bool)
-
❏ Width inference (D1.21)
-
❏ Auto-widening (D1.8.5)
-
❏ Implicit Word → Tangle coercion (D1.1)
-
❏ Exhaustiveness warnings (D1.4)
-
❏ TANGLE-JTV type extensions (three environments: Γ, Δ, Π)
-
❏ Embed/Unembed type bridges
-
❏ Purity discipline enforcement (D2.9)
-
❏ Big-step evaluator (call-by-value)
-
❏ Pattern matching (first-match, halt on failure)
-
❏ Reidemeister simplification (R1, R2, R3)
-
❏ Full twist computation
-
❏ Closure (trace operation)
-
❏ Harvard data evaluation (add{})
-
❏ Harvard control evaluation (harvard{})
-
❏ Error propagation (halt short-circuits)
-
❏ Jones polynomial (Kauffman bracket)
-
❏ Alexander polynomial (Fox calculus)
-
❏ HOMFLY-PT polynomial (skein relation)
-
❏ Writhe computation
-
❏ Linking number
-
❏ Plugin architecture for custom invariants
-
Richer error handling (exceptions, Result types) — D1.15 future review
-
assertvsprovesplit for static verification — D1.15.1 future review -
Module re-exports (Rust-style
pub use) — D2.11 future review -
Polynomial return types for invariants
-
3D visualization of tangles
-
Quantum topology applications (anyonic braiding)
-
IDE support (syntax highlighting, type hints)
-
Formal proof of type safety (Progress + Preservation)