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☆49Updated 3 years ago
- Lambda normalization and conversion checking benchmarks for various implementations☆59Updated 4 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 5 years ago
- # A simple variable binding library based on well-scoped indices and environments☆25Updated last week
- 🦠 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.☆23Updated last year
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Setoid type theory implementation☆38Updated 2 years ago
- ☆36Updated 4 years ago
- Command-like expressions for real infinite-precision calculations☆54Updated 2 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 years ago
- A tiny language for teaching and experimenting with Refinement Types☆49Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- Demo for dependent types + runtime code generation☆72Updated 8 months ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months 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
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆22Updated 8 years ago
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- An enhanced unification algorithm for Coq☆56Updated 6 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- ☆49Updated 2 months ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- A tutorial on how Agda infers things☆62Updated 3 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A pure type system implemented in OCaml☆77Updated 4 years ago
- Paper and talk☆55Updated 2 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- Implementation for ICFP 2020 paper☆54Updated 4 years ago