mmcqd / pureLinks
A pure type system implemented in OCaml
☆77Updated 4 years ago
Alternatives and similar repositories for pure
Users that are interested in pure are comparing it to the libraries listed below
Sorting:
- A dependent type theory with user defined data types☆46Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆59Updated last year
- Fωμ type checker and compiler☆54Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 11 months ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆108Updated 2 years ago
- 🦠 Reusable components based on algebraic effects☆50Updated 8 months ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated 2 weeks ago
- A verified compiler for a lazy functional language☆36Updated 2 weeks ago
- A core language and API for dependently typed languages☆94Updated 3 months ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 3 months ago
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- A simple ML-like language with subtyping, polymorphism, higher rank types, and global type inference☆51Updated 3 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Fast equality saturation in Haskell☆84Updated 3 months ago
- Example language server (LSP) implementation for a toy language☆59Updated 3 years ago
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 3 months ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Efficient binder representation in OCaml☆42Updated 10 months ago
- Efficient effect handlers based on Evidence Passing Semantics.☆30Updated 4 years ago
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- being an operating system for typechecking processes☆126Updated 2 years ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- ICFP tutorial☆39Updated 3 years ago