Tiny dependent calculus with inference of irrelevance and erasure
☆15Jan 17, 2020Updated 6 years ago
Alternatives and similar repositories for itt
Users that are interested in itt are comparing it to the libraries listed below
Sorting:
- Simply-typed lambda calculus (plus several features) -> x86 executables for Linux and Windows☆25Jan 25, 2013Updated 13 years ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Control.Effects☆19Apr 14, 2019Updated 6 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Haskell Type Level Example Programs☆28Nov 30, 2017Updated 8 years ago
- Fine-grain implementations of common lambda calculi in Haskell, tested with QuickCheck☆36Jul 11, 2021Updated 4 years ago
- Proofs of the number of inhabitants of polymorphic functions☆23Jul 19, 2018Updated 7 years ago
- Compiler for type theoretic lambda calculi equipped with system primtives which compiles side-effecting, strict expressions into efficien…☆44Jul 27, 2019Updated 6 years ago
- Proof combinators used in Liquid Haskell for theorem proving☆12Mar 28, 2018Updated 7 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆12May 22, 2016Updated 9 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- A nano "theorem prover".☆62Feb 15, 2019Updated 7 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆21Jun 3, 2022Updated 3 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- Pure Type Systems for Functional Programming☆11Jun 11, 2014Updated 11 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Dijkstra's shortest path algorithm implemented at type level with Haskell☆20Dec 11, 2017Updated 8 years ago
- A clean implementation of Parsing with Zippers.☆38Sep 22, 2018Updated 7 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Dependently typed elimination functions using singletons☆28Jan 11, 2026Updated last month
- Bring fusion to everyone☆14Feb 6, 2020Updated 6 years ago
- A nullary type class for partial functions☆15Nov 28, 2017Updated 8 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- TODO☆23Oct 10, 2015Updated 10 years ago
- Tentative write-up of a neat trick used in the Mezzo type-checker☆15Nov 27, 2015Updated 10 years ago
- ☆45Jun 20, 2019Updated 6 years ago
- Recursion schemes for Idris☆64Aug 23, 2018Updated 7 years ago
- Another experiment in dependently typed languages, this time with some quantitative type theory smooshed in.☆18Oct 12, 2018Updated 7 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- A usable type system for call by push-value☆33Dec 16, 2019Updated 6 years ago
- Pure Type Systems for Functional Programming☆31Nov 21, 2020Updated 5 years ago
- Template repo for theorem proving in Liquid Haskell☆32Sep 19, 2018Updated 7 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30May 10, 2022Updated 3 years ago
- An implementation of Functional Reactive Programming☆41Mar 2, 2015Updated 11 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51May 5, 2022Updated 3 years ago