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:
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- # A simple variable binding library based on well-scoped indices and environments☆29Updated 3 months ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Updated 5 years ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆24Updated last year
- Setoid type theory implementation☆38Updated 2 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Demo for dependent types + runtime code generation☆72Updated 11 months ago
- Command-like expressions for real infinite-precision calculations☆55Updated 6 months ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- Anders: Cubical Type Checker☆23Updated 2 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆30Updated last week
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆64Updated last year
- Quantitative Type Theory implementation☆54Updated 4 years ago
- A toy dependent typed language.☆36Updated this week
- A prototypical dependently typed languages with sized types and variances☆115Updated 3 weeks ago
- ☆52Updated 5 months ago
- ☆38Updated 4 years ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.☆27Updated 2 months ago
- being a particular fragment of Haskell, extended to a proof system☆43Updated 2 months ago
- Toy implementation of Martin-Löf Type Theory☆30Updated 3 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamics☆21Updated last year
- A type theory with native support for Polynomial Functors.☆41Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆64Updated last week
- Toy typechecker for Insanely Dependent Types☆82Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆85Updated 9 years ago
- A formalization of System Fω in Agda☆20Updated last month