Lambda normalization and conversion checking benchmarks for various implementations
☆59Apr 15, 2021Updated 4 years ago
Alternatives and similar repositories for normalization-bench
Users that are interested in normalization-bench are comparing it to the libraries listed below
Sorting:
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- ☆12Feb 11, 2019Updated 7 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Oct 15, 2025Updated 4 months ago
- A SKI combinators interpreter written in assembly☆20Jul 25, 2020Updated 5 years ago
- Attempt to prove semantic preservation (forward simulation) for a simple compiler.☆12May 1, 2024Updated last year
- high-performance cubical evaluation☆79Apr 27, 2025Updated 10 months ago
- A formalization of Pure Type Systems (PTS) in Agda☆28Jul 3, 2025Updated 8 months ago
- ☆16Mar 11, 2022Updated 3 years ago
- my phd thesis☆26Aug 7, 2024Updated last year
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- Experimenting on ornamentation in Agda via reflection.☆12Jul 1, 2023Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆65Updated this week
- A LaTeX-typeset reproduction of Reynolds' "Types, Abstraction and Parametric Polymorphism"☆33Feb 8, 2026Updated 3 weeks ago
- Eventually a practical 2-level TT-based compiler☆31Feb 3, 2026Updated last month
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated last year
- Benchmarking various normalization algorithms for the lambda calculus☆49Sep 1, 2022Updated 3 years ago
- Practical type inference for arbitrary-rank types☆11May 25, 2019Updated 6 years ago
- Experimental implementation of a Cubical Type Theory modeled by presheaves over posets☆14Aug 19, 2024Updated last year
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Sep 21, 2021Updated 4 years ago
- Various mechanized proof files for fun.☆13Aug 11, 2025Updated 6 months ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Compiler backend for generating Scheme code☆28Nov 27, 2025Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- A formal consistency proof of Quine's set theory New Foundations☆79Updated this week
- Distributions of Agda executable compiled into WebAssembly.☆25Nov 9, 2025Updated 3 months ago
- A logical relations model of a minimal type theory with bounded first-class universe levels mechanized in Lean.☆23Jan 28, 2026Updated last month
- Mechanizations of Type Theories☆35Jan 15, 2026Updated last month
- Robust multi-prompt delimited control and effect handlers in C/C++☆132Nov 28, 2023Updated 2 years ago
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- Linearizability Hoare Logic☆17Feb 9, 2026Updated 3 weeks ago
- ☆21Apr 15, 2018Updated 7 years ago
- ☆12Jun 13, 2023Updated 2 years ago
- An agda2hs-compatible library for well-scoped syntax☆11Nov 6, 2025Updated 3 months ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- being a particular fragment of Haskell, extended to a proof system☆43Dec 2, 2025Updated 3 months ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- Multimode simple type theory as an Agda library.☆23Sep 18, 2024Updated last year