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:
- 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
- Fωμ type checker and compiler☆54Updated 2 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated last year
- A prototype programming language for programming with runners☆91Updated 3 years ago
- Build system☆123Updated last year
- System F-omega normalization by hereditary substitution in Agda☆59Updated 5 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A verified compiler for a lazy functional language☆37Updated this week
- Normalization by Evaluation for Martin-Löf Type Theory☆128Updated last year
- A prototypical dependently typed languages with sized types and variances☆111Updated last week
- Efficient effect handlers based on Evidence Passing Semantics.☆31Updated 4 years ago
- PhD research ;; What's the difference between a typeclass/trait and a record/class/struct? Nothing really, or so I argue.☆81Updated 3 years ago
- a functional programming language with algebraic effects and handlers☆82Updated 5 months ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- 🦠 Reusable components based on algebraic effects☆51Updated 10 months ago
- Single file Lambda Calculus implementations demonstrating various type system features and interpretation techniques☆44Updated 5 months ago
- 🧊 An indexed construction of semi-simplicial and semi-cubical sets☆29Updated this week
- bollu learns implementation of dependent typing☆30Updated 2 years ago
- Demo for dependent types + runtime code generation☆69Updated 5 months ago
- A core language and API for dependently typed languages☆96Updated 5 months ago
- Duo - A research language exploring duality in programming language design☆57Updated 2 years ago
- Programming-by-example in a typed functional language with sketches. Smyth = Sketching + Myth.☆54Updated 4 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 2 months ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- LL(1) parser generator verified in Coq☆47Updated 5 years ago
- A small implementation of graded modal dependent type theory. A younger cousin to Granule.☆60Updated last year
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆131Updated 4 years ago
- Formalizations of Gradually Typed Languages in Agda☆57Updated 5 months ago