Lexer and parser generators for Standard ML, OCaml, and Haskell.
☆38Aug 19, 2022Updated 3 years ago
Alternatives and similar repositories for cmtool
Users that are interested in cmtool are comparing it to the libraries listed below
Sorting:
- SML implementation of System T from PFPL.☆11Jun 28, 2017Updated 8 years ago
- Standard ML compiler based on typed intermediate languages.☆51Aug 22, 2014Updated 11 years ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- ☆12Jan 25, 2022Updated 4 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
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")☆20Jul 4, 2013Updated 12 years ago
- Experiment with synthetic domain theory in cubical agda☆14Nov 8, 2022Updated 3 years ago
- A collection of SML utility modules that are useful for compiler writing.☆11Dec 17, 2025Updated 2 months ago
- Standard ML autoformatter☆15Dec 25, 2021Updated 4 years ago
- ☆15Oct 31, 2023Updated 2 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- Formalizations of strong normalization proofs☆35Jul 8, 2019Updated 6 years ago
- Organize mathematical thoughts☆20Oct 6, 2023Updated 2 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A language-integrated proof assistant, for and in Racket☆39Aug 26, 2016Updated 9 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- A dynamically-typed CBPV language embedded in Racket☆40Mar 6, 2024Updated last year
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Generalized syntax & semantics for universe hierarchies☆32Dec 11, 2023Updated 2 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- Interpreter for functional pure type systems.☆21Jun 30, 2017Updated 8 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- A server for the forester tool☆17Dec 10, 2024Updated last year
- An llvm pretty printer inspired by the haskell llvm binding☆31Updated this week
- ☆12Mar 13, 2025Updated 11 months ago
- 🪆 A Staged Type Theory☆35Sep 4, 2023Updated 2 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- company-mode completion back-end for MLton/Standard ML☆16Dec 7, 2020Updated 5 years ago
- Finite sets and maps for Coq with extensional equality☆30Jan 16, 2026Updated last month
- Examples from the class CMSC 330 during Summer 2015☆49Jul 23, 2015Updated 10 years ago
- Implementation of dependent type theory in SWI-Prolog☆10Oct 6, 2020Updated 5 years ago
- Experimental normalisation via scheme☆12Jul 25, 2021Updated 4 years ago
- ☆12Feb 11, 2019Updated 7 years ago