CakeML / pureLinks
A verified compiler for a lazy functional language
☆36Updated 2 weeks ago
Alternatives and similar repositories for pure
Users that are interested in pure are comparing it to the libraries listed below
Sorting:
- ☆47Updated this week
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 2 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☆49Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- ☆36Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆36Updated last year
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- IO using sized types and copatterns☆35Updated 4 years ago
- Paper and talk☆54Updated last year
- 🪆 A Staged Type Theory☆35Updated last year
- A Toy Inverse Bidirectional Typechecker☆31Updated 6 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆58Updated 4 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- Spartan implementation of H.O.T.T.☆25Updated 2 years ago
- An implementation of a simple Neural network in Idris using category theory.