stedolan / mlsubLinks
Prototype type inference engine
☆204Updated last year
Alternatives and similar repositories for mlsub
Users that are interested in mlsub are comparing it to the libraries listed below
Sorting:
- Malfunctional Programming☆351Updated last year
- Coq formalizations of functional languages.☆145Updated 5 years ago
- 1ML prototype interpreter☆290Updated 5 years ago
- The Makam Metalanguage☆199Updated 2 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated last week
- A compiler for functional programs on serialized data☆174Updated this week
- A comparison of how computational effects and handlers are implemented in various programming languages.☆146Updated 6 years ago
- Contextual types meet mechanized metatheory!☆206Updated 4 months ago
- An experimental type checker for a modal dependent type theory.☆116Updated 5 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Updated 4 years ago
- Alternative algorithm for algebraic subtyping.☆174Updated 2 months ago
- Type-checker for the λΠ-calculus modulo rewriting☆225Updated 2 months ago
- Normalization by Evaluation for Martin-Löf Type Theory☆130Updated last year
- A proof assistant for general type theories☆310Updated 5 months ago
- Spartan type theory☆273Updated 4 months ago
- A library for effects in Coq.☆65Updated 3 years ago
- The People's Refinement Logic☆229Updated 3 years ago
- A compiler from a small functional language to C. Especially features algebraic effects and handlers with multishot continuations, and a …☆91Updated 7 years ago
- An implementation of a predicative polymorphic language with bidirectional type inference and algebraic data types☆90Updated 2 years ago
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- 😎TT☆241Updated 2 months ago
- A prototype programming language for programming with runners☆92Updated 4 years ago
- an implementation of stuck macros☆152Updated last month
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆214Updated 3 years ago
- Algebraic, staged parsing for OCaml: typed, compositional, and faster than yacc☆104Updated 8 months ago
- higher order dependently typed logic programing☆173Updated 7 years ago
- A "implementation" of Girard's paradox in OCaml☆110Updated 10 years ago
- Benchmarks for capture-avoiding substitution☆122Updated 8 months ago
- A small implementation of higher-order unification☆192Updated 8 years ago
- Unification and type inference algorithms☆127Updated 10 years ago