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:
- Mtac in Agda☆28Updated 4 years ago
- IO using sized types and copatterns☆36Updated 4 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Updated 7 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Updated 8 years ago
- A bare-bones LCF-style proof assistant☆25Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated 3 weeks ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆36Updated 5 years ago
- Generalized syntax & semantics for universe hierarchies☆32Updated 2 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- Observational Type Theory as an Agda library☆56Updated 8 years ago
- ☆16Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆44Updated 5 years ago
- Formalizations of strong normalization proofs☆35Updated 6 years ago
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- A dependently typed type checker for a TT with intervals☆23Updated 5 years ago
- A Haskell to Coq compiler that represents effectful programs with the free monad☆45Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 6 years ago
- Experimental proof assistant (and architecture) for dependent linear logic☆51Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 5 years ago
- Category theory and algebra☆26Updated 9 years ago
- Fintie Sets in Cubical Agda☆12Updated 6 years ago
- Formalizing nbe in agda☆32Updated 13 years ago
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago