Calculus of Constructions
☆18Jul 17, 2019Updated 6 years ago
Alternatives and similar repositories for coc
Users that are interested in coc are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- Pure Type Systems for Functional Programming☆11Jun 11, 2014Updated 11 years ago
- A tiny implementation of dependent types.☆11Oct 24, 2017Updated 8 years ago
- Syntactic evaluation of STLC (incl. proof of normalization a la Software Foundations)☆13Nov 19, 2017Updated 8 years ago
- Resources for "One Monad to Prove Them All"☆29Dec 31, 2018Updated 7 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- A showcase of interesting code and proof developments in Cedille☆36Jun 10, 2025Updated 9 months ago
- being the programs and code for a paper about general recursion☆26Feb 15, 2015Updated 11 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- A Certified Interpreter for ML with Structural Polymorphism☆45Apr 11, 2025Updated 11 months ago
- Tiny dependent calculus with inference of irrelevance and erasure☆15Jan 17, 2020Updated 6 years ago
- A formalization of continuation-passing style calculi in Coq [WIP]☆38Mar 10, 2026Updated last week
- Paradoxes of type theory, described didactically. With accompanying proofs in Agda.☆41Oct 5, 2020Updated 5 years ago
- Tiny type-checker with dependent types☆78Jan 8, 2014Updated 12 years ago
- ☆16Feb 18, 2025Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 4 months ago
- Agda proofs for some of the theorems in Robert Harper's Practical Foundations of Programming Languages.☆53Jul 24, 2019Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- LL(1) parser generator verified in Coq☆48Jan 30, 2020Updated 6 years ago
- A toy compiler based on SPJ's "The Implementation of Functional Programming Languages"☆25Jun 9, 2024Updated last year
- Self-contained repository for the eponymous paper☆30Jan 11, 2019Updated 7 years ago
- ☆56Feb 26, 2026Updated 3 weeks ago
- Type-preserving CPS translation for simply- and dependently-typed lambda calculi☆19Jun 3, 2017Updated 8 years ago
- Toy demo of lexing/parsing in Coq☆12Jul 3, 2019Updated 6 years ago
- A certified semantics for relational programming workout.☆26Oct 15, 2020Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Jul 9, 2018Updated 7 years ago
- Haskell implementation of interaction net-based lambda evaluation☆21Jun 24, 2016Updated 9 years ago
- Class instances for Coq inductive types with little boilerplate☆27Mar 5, 2026Updated 2 weeks ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- A simple, untyped, terminating functional language that is fully compatible with optimal reductions.☆18Jun 17, 2019Updated 6 years ago
- Dependently typed Algorithm M and friends☆26Jun 2, 2018Updated 7 years ago
- ☆16Mar 11, 2022Updated 4 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- IO for Gallina☆34Dec 17, 2025Updated 3 months ago
- Observational Type Theory as an Agda library☆59May 27, 2017Updated 8 years ago
- Mechanized proofs and example programs for the paper Type Inference Logics, published at OOPSLA24.☆11Aug 28, 2024Updated last year
- Based on paper by Greg Morrisett , TAL-0 is the design of a RISC-style typed assembly language which focuses on control-flow safety.☆23Dec 14, 2016Updated 9 years ago
- Implementation of sprintf for Coq☆19Apr 6, 2020Updated 5 years ago