Language-runtime verification scaffold
Unlambda
Problem
Build explicit semantics, typed boundaries, and verification gates.
Approach
ATS interfaces, Idris proofs, and SPARK bounded-allocation work.
Verification and limits
The published scaffold is not a compiler-certified complete Unlambda runtime or a verified generational slot-map heap.
This project summary reviews public documentation. It does not substitute for the project's build, tests, proof audit, or independent evaluation.
License
Proprietary; source visible. The actual project terms govern use.
Read project terms ↗