Prototype type inference engine
☆204Jan 31, 2025Updated last year
Alternatives and similar repositories for mlsub
Users that are interested in mlsub are comparing it to the libraries listed below
Sorting:
- Alternative algorithm for algebraic subtyping.☆174Feb 14, 2026Updated 2 weeks ago
- A simple implementation of linear type theory☆39Apr 21, 2017Updated 8 years ago
- Malfunctional Programming☆352Nov 10, 2024Updated last year
- 1ML prototype interpreter☆292Jun 28, 2020Updated 5 years ago
- Work on modular implicits☆25Oct 23, 2018Updated 7 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Aug 31, 2019Updated 6 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- An experimental type checker for a modal dependent type theory.☆116May 9, 2020Updated 5 years ago
- Toy typechecker for Insanely Dependent Types☆82Oct 15, 2025Updated 4 months ago
- A Toy Inverse Bidirectional Typechecker☆32May 13, 2019Updated 6 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Sep 13, 2021Updated 4 years ago
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- A small implementation of higher-order unification☆192Aug 6, 2017Updated 8 years ago
- secret project☆17Mar 14, 2018Updated 7 years ago
- Contextual types meet mechanized metatheory!☆207Sep 30, 2025Updated 5 months ago
- A simple ML-like programming language with subtyping and full type inference.☆188Dec 1, 2024Updated last year
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- An implementation of Typed Assembly Language (Morrisett, Walker, Crary, Glew)☆150Sep 30, 2021Updated 4 years ago
- A small Haskell implementation of Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism☆101May 9, 2017Updated 8 years ago
- SubML (prototype) language☆22Mar 20, 2022Updated 3 years ago
- Normalization by evaluation for Martin-Löf Type Theory with dependent records☆101Jun 8, 2022Updated 3 years ago
- ☆10May 3, 2017Updated 8 years ago
- Playing with type systems☆51Dec 29, 2024Updated last year
- Oversimplified version of Simple-sub: without recursive types, without nested let polymorphism, and with approximated type-variable-to-ty…☆27Jun 18, 2022Updated 3 years ago
- Staged metaprogramming in stock OCaml☆155Mar 24, 2024Updated last year
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- being the emperor of Mongo, but also a verb☆15Dec 25, 2018Updated 7 years ago
- "Between the darkness and the dawn, a red cube rises!": a proof assistant for cartesian cubical type theory☆215Mar 25, 2022Updated 3 years ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writ…☆22May 20, 2021Updated 4 years ago
- Normalization by Evaluation for Martin-Löf Type Theory☆133Jun 5, 2024Updated last year
- Frank compiler☆305Apr 23, 2024Updated last year
- OCaml backend for Agda☆39Oct 4, 2018Updated 7 years ago
- Label dependent dependent session types☆16May 2, 2024Updated last year
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Demo for high-performance type theory elaboration☆585Feb 2, 2026Updated 3 weeks ago
- 🦠 An experimental elaborator for dependent type theory using effects and handlers☆37Nov 21, 2025Updated 3 months ago
- Formalising Type Theory in a modular way for translations between type theories☆95Jan 10, 2018Updated 8 years ago