Staged compilation with dependent types
☆187Feb 1, 2026Updated last month
Alternatives and similar repositories for staged
Users that are interested in staged are comparing it to the libraries listed below
Sorting:
- Minimal implementations for dependent type checking and elaboration☆768Jan 30, 2026Updated last month
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated last month
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- Eventually a practical 2-level TT-based compiler☆32Feb 3, 2026Updated last month
- 😎TT☆240Nov 20, 2025Updated 3 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Jan 30, 2024Updated 2 years ago
- high-performance cubical evaluation☆80Feb 27, 2026Updated last week
- Setoid type theory implementation☆38Aug 24, 2023Updated 2 years ago
- Benchmarking various normalization algorithms for the lambda calculus☆49Sep 1, 2022Updated 3 years ago
- (WIP) Dependently-typed programming language with Agda style dependent pattern matching☆80Oct 5, 2020Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Dec 8, 2021Updated 4 years ago
- Meta-theory and normalization for Fitch-style modal lambda calculi☆19May 27, 2024Updated last year
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- A dependent type theory with user defined data types☆47Oct 1, 2021Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Staged push/pull fusion with typed Template Haskell☆62Dec 17, 2023Updated 2 years ago
- being an operating system for typechecking processes☆132Oct 7, 2025Updated 4 months ago
- A core language and API for dependently typed languages☆97Feb 19, 2025Updated last year
- Implementation for ICFP 2020 paper☆54Jul 5, 2021Updated 4 years ago
- A toy dependent typed language.☆46Updated this week
- Dependent type checker using normalisation by evaluation☆274Sep 5, 2024Updated last year
- ☆52Aug 14, 2025Updated 6 months ago
- A cost-aware logical framework, embedded in Agda.☆77Feb 23, 2026Updated last week
- 🧊 kado カド: Cofibrations in Cartesian Cubical Type Theory☆22Nov 20, 2025Updated 3 months ago
- A fast functional language based on two level type theory☆392Jan 6, 2023Updated 3 years ago
- Dependently-typed row-polymorphic programming language, evolved from minitt-rs☆99Sep 21, 2020Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆66Nov 29, 2020Updated 5 years ago
- A formalization of the polymorphic lambda calculus extended with iso-recursive types☆75May 10, 2019Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆122May 30, 2025Updated 9 months ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Aug 25, 2025Updated 6 months ago
- ☆17Apr 4, 2024Updated last year
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Oct 4, 2020Updated 5 years ago
- Demo for dependent types + runtime code generation☆72Feb 18, 2025Updated last year
- An experimental proof assistant based on a type theory for synthetic ∞-categories.☆271Feb 8, 2026Updated 3 weeks ago
- an implementation of stuck macros☆152Dec 24, 2025Updated 2 months ago
- A simple implementation of XTT, "A cubical language for Bishop sets"☆27Apr 22, 2022Updated 3 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Lecture notes on realizability☆75Feb 21, 2025Updated last year
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆20Feb 26, 2021Updated 5 years ago