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
Sorting:
- This package provides a Coq formalization of abstract algebra using a functional programming style. The modules contained within the pack…☆28Updated 6 years ago
- Toy demo of lexing/parsing in Coq☆12Updated 5 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆34Updated 2 months ago
- Formalization in Coq of algorithms used in compilers for the Compiler.org project☆15Updated 6 years ago
- A Coq plugin to disable positivity check, guard check and termination check☆16Updated 5 years ago
- A showcase of interesting code and proof developments in Cedille☆36Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Dependently typed Algorithm M and friends☆25Updated 6 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated this week
- Mtac in Agda☆28Updated 4 years ago
- A Coq to Cedille compiler written in Coq☆34Updated 4 years ago
- Haskell implementation of nominal datatypes and functions☆43Updated 4 years ago
- Session types in Idris2!☆27Updated 4 years ago
- Implementation of sprintf for Coq☆18Updated 5 years ago
- Resources for "One Monad to Prove Them All"☆29Updated 6 years ago
- A clean implementation of Parsing with Zippers.☆38Updated 6 years ago
- An unimaginatively named monorepo for misc. side-projects that are annoying to maintain separately.☆14Updated 4 years ago
- IO using sized types and copatterns☆34Updated 4 years ago
- Linear map categories in Agda☆5Updated 2 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 4 months ago
- Benchmarking tool for compile-time performance of Agda programs☆18Updated 3 years ago
- being a particular fragment of Haskell, extended to a proof system☆32Updated 2 months ago
- ☆17Updated 6 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 6 years ago
- Algebraic proof discovery in Agda☆33Updated 3 years ago
- A simple implementation of linear type theory☆38Updated 8 years ago
- ☆18Updated 3 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Functional Pearl: Certified Binary Search in a Read-Only Array☆28Updated 3 years ago