mmcqd / pure
A pure type system implemented in OCaml
☆78Updated 4 years ago
Alternatives and similar repositories for pure:
Users that are interested in pure are comparing it to the libraries listed below
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- 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.☆58Updated 11 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Fωμ type checker and compiler☆53Updated 2 years ago
- bollu learns implementation of dependent typing☆28Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆57Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A prototypical dependently typed languages with sized types and variances☆107Updated 2 years ago
- LL(1) parser generator verified in Coq☆46Updated 5 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- An experimental Haskell library for programming with effectful runners.☆29Updated 5 years ago
- A verified compiler for a lazy functional language☆34Updated 2 weeks ago
- A prototype programming language for programming with runners☆89Updated 3 years ago
- Example row-polymorphism implementations☆61Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 2 months ago
- A "implementation" of Girard's paradox in OCaml☆106Updated 10 years ago
- A core language and API for dependently typed languages☆91Updated last month
- The compilation target that functional programmers always wanted.☆62Updated 4 years ago
- The Evolution of a Typechecker☆54Updated 6 years ago
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆39Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆101Updated last year
- ICFP tutorial☆39Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆50Updated 8 months ago
- a functional programming language with algebraic effects and handlers☆82Updated last month
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 3 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆47Updated 2 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year