nbenton / coqdomainsView external linksLinks
Domain theory and denotational semantics in Coq
☆10Dec 13, 2014Updated 11 years ago
Alternatives and similar repositories for coqdomains
Users that are interested in coqdomains are comparing it to the libraries listed below
Sorting:
- Jason Reed's Tiny LF, and some experiments in higher-order proof refinement logics using Jon Sterling Thought☆14May 15, 2017Updated 8 years ago
- A port of miniprl to Haskell with co-/inductive types bolted on the side.☆22May 13, 2016Updated 9 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- Typecoin: Massively Multiplayer Online Linear Logic☆18May 5, 2017Updated 8 years ago
- Implementation of Nuprl's type theory in Coq☆46Dec 3, 2024Updated last year
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Type-Theory in Sequent Calculus☆14Jul 30, 2015Updated 10 years ago
- ☆28Jun 18, 2020Updated 5 years ago
- A small implementation of a proof refinement logic.☆50Jul 3, 2017Updated 8 years ago
- A discouraging story.☆16May 8, 2018Updated 7 years ago
- ☆17Oct 16, 2018Updated 7 years ago
- Agda code for experimenting with internal models of cubical type theory☆15Apr 3, 2018Updated 7 years ago
- A dependently typed programming language, and verification tool☆27Apr 3, 2016Updated 9 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Coherence typechecker for Grothendieck/Maltsiniotis style infinity categories☆15Mar 26, 2017Updated 8 years ago
- Haskell implementation of the Edinburgh Logical Framework☆32Jan 12, 2026Updated last month
- Cohesive type theory☆19Dec 6, 2021Updated 4 years ago
- ☆48Jul 5, 2019Updated 6 years ago
- An interactive interpreter for asynchronous algebraic effects☆15Jun 19, 2024Updated last year
- (the first half of) an ML compiler☆10Sep 6, 2014Updated 11 years ago
- The original Edinburgh LCF.☆34Oct 21, 2016Updated 9 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆21Oct 9, 2018Updated 7 years ago
- Simply typed lambda calculus in cubical agda☆22Feb 22, 2020Updated 5 years ago
- Simplified Observational Type Theory☆87May 5, 2023Updated 2 years ago
- second-order abstract syntax☆31Sep 15, 2021Updated 4 years ago
- being the beginnings of at least zero typecheckers☆34Apr 13, 2017Updated 8 years ago
- Mtac in Agda☆29May 4, 2021Updated 4 years ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- what I did on my holidays☆12Jul 9, 2018Updated 7 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- Abstract binding tree code generator☆37Oct 31, 2016Updated 9 years ago
- Specification of Agda.☆25Jan 13, 2019Updated 7 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- Combinatorial species in HoTT☆12May 23, 2015Updated 10 years ago
- ☆17Oct 31, 2025Updated 3 months ago
- Two attempts at formalizing Löb's Theorem, (one based on http://lesswrong.com/lw/t6/the_cartoon_guide_to_l%C3%B6bs_theorem/). Write-up at…☆25Jun 30, 2023Updated 2 years ago