rossberg / 1mlLinks
1ML prototype interpreter
☆289Updated 5 years ago
Alternatives and similar repositories for 1ml
Users that are interested in 1ml are comparing it to the libraries listed below
Sorting:
- Malfunctional Programming☆350Updated last year
- Prototype type inference engine☆204Updated 10 months ago
- Dependent type checker using normalisation by evaluation☆269Updated last year
- The Makam Metalanguage☆197Updated 2 years ago
- Frank compiler☆300Updated last year
- A compiler for functional programs on serialized data☆172Updated this week
- Cedille, a dependently typed programming languages based on the Calculus of Dependent Lambda Eliminations☆382Updated 2 years ago
- Spartan type theory☆271Updated 2 months ago
- Contextual types meet mechanized metatheory!☆203Updated 2 months ago
- Bootstrapping ATS3☆234Updated last week
- ATS2: Unleashing the Potentials of Types and Templates☆376Updated 5 months ago
- SML reference interpreter☆119Updated last month
- Embeddable Lambda Prolog Interpreter☆326Updated last week
- A version of the 1997 SML definition with corrections and some proposed Successor ML features added.☆205Updated last year
- A proof assistant for general type theories☆307Updated 3 months ago
- Haskell implementation of Dunfield and Krishnaswami's "Complete and easy bidirectional typechecking for higher-rank polymorphism"☆134Updated 5 years ago
- an implementation of stuck macros☆149Updated 2 weeks ago
- The Twelf Programming Language☆143Updated last week
- Alternative algorithm for algebraic subtyping.☆170Updated 2 weeks ago
- Standard ML Compiler and Toolkit☆292Updated 2 weeks ago
- ☆137Updated 3 years ago
- Nanopass for OCaml☆149Updated 7 years ago
- Libhandler implements algebraic effects and handlers in portable C99. Monads for free in C.☆205Updated 5 years ago
- A language server for Standard ML in Rust.☆230Updated 2 months ago
- An OCaml lexer generator for Unicode☆262Updated last week
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆210Updated 3 years ago
- A comparison of how computational effects and handlers are implemented in various programming languages.☆143Updated 6 years ago
- A simple ML-like programming language with subtyping and full type inference.☆183Updated last year
- A statically-typed programming language based on "F-ing modules"☆81Updated 5 years ago
- An implementation of Pie in Haskell☆211Updated 6 years ago