kcrary / cmtoolLinks
Lexer and parser generators for Standard ML, OCaml, and Haskell.
☆37Updated 3 years ago
Alternatives and similar repositories for cmtool
Users that are interested in cmtool are comparing it to the libraries listed below
Sorting:
- A dynamically-typed CBPV language embedded in Racket☆40Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 2 weeks ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 3 weeks ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 10 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 4 years ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 years ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Work in progress☆40Updated 7 months ago
- Constructive Galois connections☆36Updated 7 years ago
- Standard ML compiler based on typed intermediate languages.☆51Updated 11 years ago
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- Implementation of Nuprl's type theory in Coq☆46Updated last year
- Coq formalizations of Sequent Calculus, Natural Deduction, etc. systems for propositional logic☆45Updated 9 years ago
- ☆38Updated 4 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated 2 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- The Mechanization of Standard ML☆74Updated 3 years ago
- An attempt towards univalent classical mathematics in Cubical Agda.☆32Updated 2 years ago
- A Toy Inverse Bidirectional Typechecker☆32Updated 6 years ago