0.2.2 Symbol Tables & Name Resolution (Including Posets) #13

Desired function
Resolve names over scope chains, modules, and poset-style declarations; solve partial-order constraints via a bespoke constraint solver; detect ambiguities and cycles.

Inputs

• Parsed AST with lexical scopes, imports, modules.
• Poset-style declaration constraints across files (partial order, meet/join operations).

Processing

• Build scope chains, resolve names to declarations.
• Solve poset constraints via a bespoke constraint-solver:
  • Multiple declarations related by partial orders; compute consistent meets/joins when required.
• Detect ambiguities, cycles, or unsatisfied constraints.

Outputs

• Fully resolved AST/IR with symbol IDs.
• Diagnostics for unresolved/ambiguous names or incoherent poset constraints.
• Symbol Tables & Name Resolution