chrisroman / coc
Calculus of Constructions Implementation
β15Updated 5 years ago
Alternatives and similar repositories for coc:
Users that are interested in coc are comparing it to the libraries listed below
- Two-Level Type Theoryβ28Updated 5 years ago
- LL(1) parser generator verified in Coqβ46Updated 5 years ago
- π©Ί A library for compiler diagnosticsβ41Updated 2 months ago
- Didactic implementation of the type checker described in "Complete and Easy Bidirectional Typechecking for Higher-Rank Polymorphism" writβ¦β22Updated 3 years ago
- β21Updated 7 years ago
- Experimental type-checker for internally parametric type theoryβ32Updated 3 weeks ago
- Quantitative Type Theory implementationβ54Updated 3 years ago
- Monad-based linear types in OCaml, with a few syntax extensionsβ37Updated 5 years ago
- mechanization paired with https://github.com/hazelgrove/hazelnut-dynamicsβ21Updated 10 months ago
- Hanoi tower in Coqβ25Updated 4 months ago
- A Toy Inverse Bidirectional Typecheckerβ31Updated 5 years ago
- A repository of MetaOCaml packagesβ12Updated last year
- πͺ A Staged Type Theoryβ35Updated last year
- Work in progress on semi-simplicial typesβ23Updated 2 years ago
- Toy implementation of Martin-LΓΆf Type Theoryβ28Updated 2 years ago
- Coq library and tactic for deciding Kleene algebras [maintainer=@tchajed]β23Updated 5 months ago
- Accessing Agda's interaction mode via command line & external tactic for Agda.β26Updated 4 years ago
- A simple implementation of XTT, "A cubical language for Bishop sets"β26Updated 2 years ago
- Coq proof for elaborating row polymorphism and bounded polymorphism into disjoint polymorphism.β13Updated 4 years ago
- Formalising session types in Coqβ17Updated 5 years ago
- A dependent type theory with user defined data typesβ46Updated 3 years ago
- A minimal example of a formally verified parser using ocamllex and Menhir's Coq backend.β20Updated 10 years ago
- Formalization of type theoryβ22Updated 3 years ago
- A Unifying Cartesian Cubical Set Modelβ35Updated 5 years ago
- SML Checker for Intersection and Datasort Refinements (pronounced "cider")β20Updated 11 years ago
- A formalization of System FΟ in Agdaβ17Updated 2 months ago
- Implementations of F-ing modules and 1ML, as well as bibliography of (mainly ML-style) modulesβ31Updated 2 years ago
- A type theory with native support for Polynomial Functors.β39Updated last year
- Kleene algebra modulo theoriesβ27Updated 2 years ago
- A termination checker for higher-order rewriting with dependent typesβ10Updated 4 years ago