CakeML / pureLinks
A verified compiler for a lazy functional language
☆37Updated this week
Alternatives and similar repositories for pure
Users that are interested in pure are comparing it to the libraries listed below
Sorting:
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- Quantitative Type Theory implementation☆54Updated 4 years ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- ☆52Updated 5 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- ☆38Updated 4 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Command-like expressions for real infinite-precision calculations☆55Updated 6 months ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 7 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- ☆17Updated last year
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- General topology in Coq [maintainers=@amiloradovsky,@Columbus240,@stop-cran]☆51Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago