Benchmarks for capture-avoiding substitution
☆122May 30, 2025Updated 9 months ago
Alternatives and similar repositories for lambda-n-ways
Users that are interested in lambda-n-ways are comparing it to the libraries listed below
Sorting:
- Dependently typed programming language written in Haskell☆22Feb 14, 2022Updated 4 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆56Apr 23, 2017Updated 8 years ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated 3 weeks ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆29Sep 21, 2022Updated 3 years ago
- every day i'm truffling☆70Mar 26, 2021Updated 4 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated 3 weeks ago
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- Funny little Haskell impl☆18Oct 28, 2020Updated 5 years ago
- Efficient search weighted by an ordered monoid with monus.☆19Dec 12, 2022Updated 3 years ago
- Staged push/pull fusion with typed Template Haskell☆62Dec 17, 2023Updated 2 years ago
- A formalization of System Fω in Agda☆20Dec 23, 2025Updated 2 months ago
- ☆25Aug 30, 2024Updated last year
- Denotational semantics based on graph and filter models☆23Dec 16, 2024Updated last year
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Jul 22, 2021Updated 4 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- A cost-aware logical framework, embedded in Agda.☆77Updated this week
- Formalization of CBPV extended with effect and coeffect tracking☆14Aug 30, 2024Updated last year
- antifunext☆38Jun 27, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- A demo implementation of a simple dependently-typed language☆619Nov 18, 2024Updated last year
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- ScopeT and ScopeH☆13Aug 3, 2024Updated last year
- Artifact for paper "When Subtyping Constraints Liberate: A Novel Type Inference Approach for First-Class Polymorphism" (https://popl24.si…☆15May 22, 2024Updated last year
- Hypertypes - generic programming for heterogeneous recursive types☆124Jan 12, 2025Updated last year
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Benchmarking various normalization algorithms for the lambda calculus☆49Sep 1, 2022Updated 3 years ago
- Intrinsic Verification of Formal Grammar Theory☆27Nov 22, 2025Updated 3 months ago
- A small NuPRL style proof assistant☆31Jan 31, 2019Updated 7 years ago
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆15Jan 23, 2024Updated 2 years ago
- Formal specification of the Haskell Language Report☆30Jan 25, 2026Updated last month
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Efficient Haskell effect handlers based on evidence translation.☆86Jul 19, 2021Updated 4 years ago
- 🩺 A library for compiler diagnostics☆52Nov 21, 2025Updated 3 months ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- experimenting with unlifted classes via backpack☆37Aug 17, 2022Updated 3 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆55Sep 11, 2025Updated 5 months ago