mmcqd / pureLinks
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
Sorting:
- Fωμ type checker and compiler☆54Updated 2 years ago
- A dependent type theory with user defined data types☆47Updated 3 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 3 years ago
- A prototype programming language for programming with runners☆91Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- An experimental type checker for a modal dependent type theory.☆114Updated 5 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago
- Example row-polymorphism implementations☆61Updated last year
- 🦠 Reusable components based on algebraic effects☆51Updated last week
- A verified compiler for a lazy functional language☆37Updated 3 weeks ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 3 months ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 weeks ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Build system☆124Updated last year
- a functional programming language with algebraic effects and handlers☆82Updated 6 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Demo for dependent types + runtime code generation☆70Updated 6 months ago
- Experimental proof assistant (and architecture) for dependent linear logic☆49Updated 3 years ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 5 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- A core language and API for dependently typed languages☆97Updated 6 months ago
- A bidirectional type checker☆63Updated 8 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆82Updated 3 years ago
- A nano "theorem prover".☆62Updated 6 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A tiny language for teaching and experimenting with Refinement Types☆47Updated 4 years ago
- an implementation of stuck macros☆145Updated last week