stedolan / mlsubLinks
Prototype type inference engine
☆202Updated 4 months ago
Alternatives and similar repositories for mlsub
Users that are interested in mlsub are comparing it to the libraries listed below
Sorting:
- The Makam Metalanguage☆198Updated 2 years ago
- Malfunctional Programming☆348Updated 7 months ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆147Updated 3 years ago
- 1ML prototype interpreter☆282Updated 4 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆141Updated 6 years ago
- Example implementation of Algorithm W for Hindley-Milner type inference☆81Updated 3 years ago
- Alternative algorithm for algebraic subtyping.☆166Updated last month
- A "implementation" of Girard's paradox in OCaml☆108Updated 10 years ago
- Spartan type theory☆267Updated last year
- A small implementation of higher-order unification☆188Updated 7 years ago
- Dependent type checker using normalisation by evaluation☆262Updated 9 months ago
- An interactive theorem prover based on lambda-tree syntax☆95Updated last month
- Coq formalizations of functional languages.☆144Updated 4 years ago
- Charity language interpreters and literature☆114Updated 6 years ago
- An tutorial-style implementation of liquid/refinement types for a subset of Ocaml/Reason.☆147Updated last year
- 😎TT☆228Updated last year
- A statically-typed programming language based on "F-ing modules"☆81Updated 4 years ago
- an implementation of stuck macros☆142Updated 3 months ago
- A library for effects in Coq.☆65Updated 3 years ago
- Staged compilation with dependent types☆174Updated last month
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- An experimental type checker for a modal dependent type theory.☆112Updated 5 years ago
- Self-contained monadic parser combinators for OCaml☆149Updated last year
- Benchmarks for capture-avoiding substitution☆114Updated 3 weeks ago
- A proof assistant for general type theories☆304Updated 8 months ago
- A modular sat/smt solver with proof output.☆99Updated last year
- An proof refinement logic for computational type theory. Inspired by Nuprl. [For up-to-date development, see JonPRL's successor, RedPRL: …☆111Updated 6 years ago
- A prototypical dependently typed languages with sized types and variances☆109Updated 2 years ago
- The Twelf Programming Language☆134Updated 4 months ago
- Implementation of the λΠ-calculus modulo rewriting☆209Updated last month