mmcqd / pure
A pure type system implemented in OCaml
☆77Updated 3 years ago
Related projects ⓘ
Alternatives and complementary repositories for pure
- A dependent type theory with user defined data types☆45Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆82Updated 3 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆53Updated 6 months ago
- Fωμ type checker and compiler☆51Updated last year
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- A prototypical dependently typed languages with sized types and variances☆104Updated 2 years ago
- an implementation of stuck macros☆132Updated 2 weeks ago
- A bidirectional type checker☆57Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆56Updated 5 years ago
- LL(1) parser generator verified in Coq☆44Updated 4 years ago
- A statically-typed programming language based on "F-ing modules"☆80Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- A core language and API for dependently typed languages☆89Updated 11 months ago
- Fast equality saturation in Haskell☆77Updated 6 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆129Updated 4 years ago
- ☆47Updated last month
- Toy typechecker for Insanely Dependent Types☆79Updated 11 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated last year
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated last year
- Example language server (LSP) implementation for a toy language☆60Updated 3 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆99Updated last year
- A "implementation" of Girard's paradox in OCaml☆105Updated 9 years ago
- Duo - A research language exploring duality in programming language design☆57Updated last year
- An experimental Haskell library for programming with effectful runners.☆29Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆107Updated 2 years ago
- being an operating system for typechecking processes☆121Updated last year
- ☆35Updated 3 years ago
- ICFP tutorial☆40Updated 3 years ago