mmcqd / pure
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
- A dependent type theory with user defined data types☆46Updated 3 years ago
- Fωμ type checker and compiler☆52Updated 2 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 8 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- A core language and API for dependently typed languages☆89Updated this week
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆56Updated 9 months ago
- A verified compiler for a lazy functional language☆34Updated last week
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- Example row-polymorphism implementations☆61Updated last year
- LL(1) parser generator verified in Coq☆45Updated 5 years ago
- being an operating system for typechecking processes☆123Updated last year
- A bidirectional type checker☆59Updated 7 years ago
- Demo for dependent types + runtime code generation☆66Updated this week
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆28Updated 3 years ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- an implementation of stuck macros☆138Updated this week
- The Evolution of a Typechecker☆54Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆130Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆122Updated 8 months ago
- ☆30Updated 4 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical types☆27Updated last week
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- ☆36Updated 3 years ago
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago