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 prototype programming language for programming with runners☆91Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆83Updated 4 years ago
- A dependent type theory with user defined data types☆47Updated 4 years ago
- Fωμ type checker and compiler☆54Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆58Updated last year
- A bidirectional type checker☆64Updated 8 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- A prototypical dependently typed languages with sized types and variances☆111Updated 3 months ago
- an implementation of stuck macros☆146Updated 3 weeks ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- A verified compiler for a lazy functional language☆37Updated last week
- Build system☆128Updated 2 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 2 months ago
- System F-omega normalization by hereditary substitution in Agda☆60Updated 6 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 small implementation of graded modal dependent type theory. A younger cousin to Granule.☆61Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years 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 8 months ago
- Example row-polymorphism implementations☆61Updated 2 years ago
- Efficient effect handlers based on Evidence Passing Semantics.☆32Updated 4 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆55Updated 4 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 8 months ago
- A core language and API for dependently typed languages☆97Updated 8 months ago
- Efficient binder representation in OCaml☆43Updated last year
- MetaML and MetaOCaml bibliography☆94Updated 10 months ago