takanuva / cocLinks
Calculus of Constructions
☆17Updated 6 years ago
Alternatives and similar repositories for coc
Users that are interested in coc are comparing it to the libraries listed below
Sorting:
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Mtac in Agda☆28Updated 4 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 4 months ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 months ago
- Type Theory with Indexed Equality☆26Updated 8 years ago
- Category theory and algebra☆27Updated 9 years ago
- A universe of scope- and type-safe syntaxes (syntices?). Includes generic implementation of type-preserving renaming/substitution with al…☆16Updated 7 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 5 months ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Updated 5 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- Formalizing nbe in agda☆31Updated 12 years ago
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 8 years ago
- Tiny type-checker with dependent types☆78Updated 11 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Updated 3 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Updated 10 months ago
- ☆16Updated 3 years ago
- A version of Epigram 1 that can run with newer GHCs☆54Updated 8 years ago
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 6 months ago