kcrary / cmtoolLinks
Lexer and parser generators for Standard ML, OCaml, and Haskell.
☆38Updated 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 bare-bones LCF-style proof assistant☆25Updated 6 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Mirror of Epigram 2, by Conor McBride, et al.☆58Updated 5 years ago
- Total Parser Combinators in Coq [maintainer=@womeier]☆49Updated 6 months ago
- Formalizations of Gradually Typed Languages in Agda☆59Updated last month
- A compiler for the gradually typed lambda calculus☆76Updated 4 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- Documentation on goals of the Rocq-community organization, the shared contributing guide and code of conduct.☆68Updated 10 months ago
- A Unifying Cartesian Cubical Set Model☆35Updated 6 years ago
- The Iowa Agda Library☆53Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆32Updated 3 weeks ago
- An interactive theorem prover based on lambda-tree syntax☆98Updated 2 weeks ago
- A pedagogic implementation of abstract bidirectional elaboration for dependent type theory.☆86Updated 4 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 version of Epigram 1 that can run with newer GHCs☆55Updated 8 years ago
- A Racket library for interacting with Idris over the IDE protocol☆31Updated 8 years ago
- Resurrecting Lennart Augustsson's implementation of Cayenne☆38Updated 12 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆60Updated last year
- Abstract binding trees (abstract syntax trees plus binders), as a library in Agda☆80Updated 5 months ago
- An equational theorem prover based on Knuth-Bendix completion☆57Updated this week
- The Mechanization of Standard ML☆75Updated 3 years ago
- Tiny type-checker with dependent types☆78Updated 12 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆36Updated 10 months ago
- A reflection-based proof tactic for lattices in Coq☆21Updated 2 years ago
- System F-omega normalization by hereditary substitution in Agda☆62Updated 6 years ago
- An Agda formalization of System F and the Brown-Palsberg self-interpreter☆26Updated 5 years ago
- The source for "Compiling with Dependent Types" (my dissertation)☆30Updated 3 years ago
- Accompanying code for "Types and Programming Languages", ported to Standard ML☆30Updated 10 years ago
- 🪆 A Staged Type Theory☆35Updated 2 years ago