stedolan / mlsubLinks
Prototype type inference engine
☆204Updated 9 months ago
Alternatives and similar repositories for mlsub
Users that are interested in mlsub are comparing it to the libraries listed below
Sorting:
- Malfunctional Programming☆350Updated last year
- 1ML prototype interpreter☆288Updated 5 years ago
- Coq formalizations of functional languages.☆145Updated 5 years ago
- The Makam Metalanguage☆200Updated 2 years ago
- Alternative algorithm for algebraic subtyping.☆170Updated last month
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- A proof assistant for general type theories☆308Updated 3 months ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆149Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆129Updated last year
- An interactive theorem prover based on lambda-tree syntax☆99Updated last month
- A library for effects in Coq.☆65Updated 3 years ago
- Spartan type theory☆271Updated 2 months ago
- The People's Refinement Logic☆228Updated 2 years ago
- A compiler for functional programs on serialized data☆172Updated this week
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆90Updated 6 years ago
- Contextual types meet mechanized metatheory!☆203Updated last month
- 😎TT☆233Updated 3 months ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆213Updated 3 years ago
- Implementation of the λΠ-calculus modulo rewriting☆217Updated 2 months ago
- An experimental type checker for a modal dependent type theory.☆115Updated 5 years ago
- A "implementation" of Girard's paradox in OCaml☆109Updated 10 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆384Updated 2 years ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆133Updated 5 years ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- Frank compiler☆302Updated last year
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆102Updated 5 months ago
- An implementation of Pie in Haskell☆211Updated 6 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆150Updated last month
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago