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:
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- The Pico core language, and the Bake algorithm for elaborating Dependent Haskell into the former (WIP)☆15Feb 15, 2018Updated 8 years ago
- Resin: high performance variable binder and ast manipulation lib☆13Jan 1, 2019Updated 7 years ago
- A Haskell library for compile-time checked literal values, via QuasiQuoters.☆13Sep 20, 2021Updated 4 years ago
- Agda suffices: software written from A to Z in Agda☆16Mar 31, 2019Updated 6 years ago
- Lambda Calculus with quote and unquote☆19Jun 29, 2020Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 5 months ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago
- Prettyprinting transformers for rainbow parens, precedence, etc.☆16Feb 27, 2022Updated 4 years ago
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Quantitative Type Theory implementation☆54Jun 2, 2021Updated 4 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- being an experiment with potato power☆23Jan 14, 2020Updated 6 years ago
- Simplified Observational Type Theory☆87Feb 17, 2026Updated last month
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- Generalized Convolution and Efficient Language Recognition☆18Jul 20, 2019Updated 6 years ago
- "operating system" based on the calculus of constructions☆18Jun 22, 2022Updated 3 years ago
- Like "Write Yourself a Scheme in 48 Hours", but in Agda☆52Apr 18, 2018Updated 7 years ago
- An implementation of the Dunfield-Krishnaswami "Sound and Complete" type-system☆84Jan 3, 2018Updated 8 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- A Model of Relationally Parametric System F in Coq☆22May 27, 2015Updated 10 years ago
- Edit is a monad for rewriting things.☆23Sep 9, 2020Updated 5 years ago
- Prism-based parsers and pretty printers☆17Jan 1, 2018Updated 8 years ago
- Derive editors for data types.☆29Oct 5, 2014Updated 11 years ago
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- An implementation of Ben Lippmeier's "Don't Substitute Into Abstractions"☆15Aug 8, 2018Updated 7 years ago
- Deferring the Details and Deriving Programs☆14Aug 18, 2019Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Jun 22, 2021Updated 4 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 8 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆102Jun 8, 2022Updated 3 years ago
- Showing how some simple mathematical theories naturally give rise to some common data-structures☆39Jun 13, 2024Updated last year
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A minimal proof language.☆213Jan 26, 2019Updated 7 years ago