Query-Based Structural Solver
This module implements a declarative, query-based type solver architecture. It uses:
- Ena: For unification (Union-Find) in generic type inference
- Custom
TypeData: Structural type representation with interning - Cycle Detection: Coinductive semantics for recursive types
Key benefits:
- O(1) type equality via interning (
TypeIdcomparison) - Automatic cycle handling via coinductive semantics
- Lazy evaluation - only compute types that are queried