A garden of small programming language implementations 🪴
Normalization by evaluation for Martin-Löf Type Theory with dependent records
🦠 An experimental elaborator for dependent type theory using effects and handlers
A Teeny Type Theory
A typechecker and lazy interpreter for System U
Various implementations of normalization by evaluation.
Agda formalization of normalization by evaluation for the confluent simply-typed weak lambda-calculus.
Normalization by Evaluation for a version of Martin-Löf Type Theory with weak explicit substitutions.
WIP MoonBit proof assistant exploring dependent type theory, typed terms, and kernel-based proof checking.
Yet another typechecker for a dependently typed language.
Normalization by Evaluation for a version of System T with combinatory weak conversion.
A dependently-typed, self-hosting language with a tiny trusted kernel (cubical + quantitative types + effects). Scheme's soul, a proof assistant's spine, grown from one spore.
Dependently typed proof checker for the Calculus of Inductive Constructions. ML-family surface syntax, stack-safe normalization-by-evaluation kernel, parser built on rumil. Runs in the browser.
Experimental Rust Dhall engine: hash-consed DAG store + glued conversion checker. ~176x less peak memory on large codegen, byte-identical output.
Add a description, image, and links to the normalization-by-evaluation topic page so that developers can more easily learn about it.
To associate your repository with the normalization-by-evaluation topic, visit your repo's landing page and select "manage topics."