jonsterling / coq-domains
☆18Updated 2 years ago
Alternatives and similar repositories for coq-domains:
Users that are interested in coq-domains are comparing it to the libraries listed below
- ☆17Updated 6 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- ☆11Updated 4 years ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆20Updated 3 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 3 months ago
- Quasi-quoting library for agda☆17Updated 5 months ago
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- ☆12Updated 5 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- ModTT in Agda☆11Updated 3 years ago
- 👹 A library for hierarchical names and lexical scoping☆25Updated 7 months ago
- Higher Algebra with Opetopic Types☆15Updated 2 years ago
- Simply typed lambda calculus in cubical agda☆22Updated 5 years ago
- Experiments in Synthetic Differential Geometry☆16Updated 3 years ago
- Experiment with synthetic domain theory in cubical agda☆14Updated 2 years ago
- Domain theory and denotational semantics in Coq☆10Updated 10 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 3 years ago
- Haskell implementation of the Edinburgh Logical Framework☆27Updated 6 months ago
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago
- A Model of Relationally Parametric System F in Coq☆22Updated 9 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Updated 5 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- IO using sized types and copatterns☆34Updated 4 years ago
- Experiments with higher-order abstract syntax in Agda☆21Updated 2 years ago