takanuva / coc
Calculus of Constructions
☆17Updated 5 years ago
Alternatives and similar repositories for coc:
Users that are interested in coc are comparing it to the libraries listed below
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Mtac in Agda☆28Updated 3 years ago
- Haskell implementation of nominal datatypes and functions☆39Updated 4 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 5 years ago
- ☆17Updated 6 years ago
- Logic Explorer - customizable proof construction tool for sequent calculi☆20Updated 2 years ago
- Files for the tutorial "Correct-by-construction programming in Agda" at POPL '19 in Cascais☆26Updated 6 years ago
- Multimode simple type theory as an Agda library.☆22Updated 5 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- https://metaborg.github.io/mj.agda/☆12Updated 4 years ago
- IO using sized types and copatterns☆33Updated 3 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆71Updated 2 years ago
- Dependently typed elimination functions using singletons☆28Updated 2 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated last month
- Formalizations of strong normalization proofs☆34Updated 5 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 4 months ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- a version of the 2048 game for Coq☆22Updated last year
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Type Theory with Indexed Equality☆25Updated 7 years ago
- Implementation of sprintf for Coq☆18Updated 4 years ago
- "operating system" based on the calculus of constructions☆18Updated 2 years ago
- Formalised embedding of an imperative language with effect system into session-typed pi calculus.☆28Updated 3 months ago