Agda formalization of normalization by evaluation for the confluent simply-typed weak lambda-calculus.
-
Updated
Apr 6, 2023 - Agda
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.
Normalization by Evaluation for a version of System T with combinatory weak conversion.
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."