CakeML / pure
A verified compiler for a lazy functional language
☆32Updated last month
Related projects ⓘ
Alternatives and complementary repositories for pure
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆33Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆45Updated 2 months ago
- A Toy Inverse Bidirectional Typechecker☆31Updated 5 years ago
- 🪆 A Staged Type Theory☆34Updated last year
- Algebraic proof discovery in Agda☆32Updated 2 years ago
- ☆47Updated last month
- Mechanizations of Type Theories☆27Updated last week
- A tutorial on how Agda infers things☆36Updated 3 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆27Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- ☆27Updated last year
- A type theory with native support for Polynomial Functors.☆38Updated last year
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Anders: Cubical Type Checker☆18Updated last year
- Lambda normalization and conversion checking benchmarks for various implementations☆55Updated 3 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated 7 months ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆28Updated 11 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆38Updated 4 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- A Unifying Cartesian Cubical Set Model☆33Updated 5 years ago
- Agda formalisation of second-order abstract syntax☆52Updated 2 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- Experiments with higher-order abstract syntax in Agda☆19Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆33Updated last year
- The Evolution of a Typechecker☆54Updated 5 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- An implementation of a simple Neural network in Idris using category theory.☆22Updated 2 months ago