A lambda calculus to explore type-directed program synthesis.
☆85Jan 20, 2020Updated 6 years ago
Alternatives and similar repositories for path
Users that are interested in path are comparing it to the libraries listed below
Sorting:
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 8 months ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last week
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆51Apr 18, 2018Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Prettyprinting transformers for rainbow parens, precedence, etc.☆16Feb 27, 2022Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Apr 29, 2022Updated 3 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆131Jun 5, 2024Updated last year
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Prism-based parsers and pretty printers☆17Jan 1, 2018Updated 8 years ago
- A minimal proof language.☆212Jan 26, 2019Updated 7 years ago
- Idris tactics for (commutative) monoids☆20May 24, 2020Updated 5 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago