sweirich / pi-forallView external linksLinks
A demo implementation of a simple dependently-typed language
☆617Nov 18, 2024Updated last year
Alternatives and similar repositories for pi-forall
Users that are interested in pi-forall are comparing it to the libraries listed below
Sorting:
- Minimal implementations for dependent type checking and elaboration☆762Jan 30, 2026Updated 2 weeks ago
- Demo for high-performance type theory elaboration☆580Feb 2, 2026Updated last week
- Experimental implementation of Cubical Type Theory☆597Sep 21, 2023Updated 2 years ago
- Examples of Dependently-typed programs in Haskell☆308Oct 18, 2022Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 3 months ago
- Staged compilation with dependent types☆187Feb 1, 2026Updated last week
- Dependently Typed Lambda Calculus in Haskell☆116Mar 8, 2021Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- Strongly-typed System F in Haskell☆120Oct 18, 2022Updated 3 years ago
- 😎TT☆241Nov 20, 2025Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 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
- Functional programming with fewer indirections☆778Aug 20, 2020Updated 5 years ago
- higher order dependently typed logic programing☆173Aug 7, 2018Updated 7 years ago
- An implementation of Pie in Haskell☆211Nov 8, 2019Updated 6 years ago
- Total Parser Combinators in Agda☆133Aug 5, 2025Updated 6 months ago
- An introduction to programming language theory in Agda☆1,486Jan 27, 2026Updated 2 weeks ago
- The People's Refinement Logic☆229Jan 1, 2023Updated 3 years ago
- A Specification for Dependent Types in Haskell (Core)☆64Jun 30, 2022Updated 3 years ago
- A statically-typed linear functional language with graded modal types for fine-grained program reasoning☆700Jan 14, 2026Updated last month
- A collection of resources for learning type theory and type theory adjacent fields.☆2,415Apr 21, 2025Updated 9 months ago
- Benchmarks for capture-avoiding substitution☆122May 30, 2025Updated 8 months ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆389Oct 23, 2023Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- GRIN is a compiler back-end for lazy and strict functional languages with whole program optimization support.☆1,059Jun 13, 2025Updated 8 months ago
- Proof assistant based on the λΠ-calculus modulo rewriting☆372Updated this week
- A proof assistant for general type theories☆310Aug 9, 2025Updated 6 months ago
- Replib: generic programming & Unbound: generic treatment of binders☆46Oct 18, 2022Updated 3 years ago
- yacctt: Yet Another Cartesian Cubical Type Theory☆76Jul 30, 2018Updated 7 years ago
- Frank compiler☆304Apr 23, 2024Updated last year
- A collaborative bibliography of work related to the theory and practice of computational effects☆1,113Nov 4, 2025Updated 3 months ago
- Tricks you wish the Coq manual told you [maintainer=@tchajed]☆538May 28, 2025Updated 8 months ago
- Liquid Types For Haskell☆1,288Updated this week
- Dependent type checker using normalisation by evaluation☆273Sep 5, 2024Updated last year
- Contextual types meet mechanized metatheory!☆206Sep 30, 2025Updated 4 months ago
- A lambda calculus to explore type-directed program synthesis.☆85Jan 20, 2020Updated 6 years ago
- Parsing all context-free grammars using Earley's algorithm in Haskell.☆378May 14, 2023Updated 2 years ago
- Example language server (LSP) implementation for a toy language☆60Jul 21, 2021Updated 4 years ago