tomdjong / domain-theory-in-uf
☆11Updated 4 years ago
Alternatives and similar repositories for domain-theory-in-uf:
Users that are interested in domain-theory-in-uf are comparing it to the libraries listed below
- A formalization of Pure Type Systems (PTS) in Agda☆23Updated 2 weeks ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 6 years ago
- The Agda Universal Algebra Library (UALib) is a library of types and programs (theorems and proofs) that formalizes the foundations of un…☆19Updated 3 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 6 years ago
- Quasi-quoting library for agda☆17Updated 2 months ago
- Haskell implementation of the Edinburgh Logical Framework☆26Updated 3 months ago
- ☆18Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Mtac in Agda☆28Updated 3 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- ☆23Updated 6 months ago
- Verified NbE via gluing in Agda☆11Updated 8 months ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 3 years ago
- ☆17Updated 2 years ago
- Congruence Closure Procedure in Cubical Agda☆16Updated 4 years ago
- my phd thesis☆26Updated 5 months ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Updated 8 years ago
- ☆27Updated last year
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- Experimenting on ornamentation in Agda via reflection.☆12Updated last year
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 6 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- ☆13Updated 7 months ago
- a version of the 2048 game for Coq☆22Updated last year
- Notes (and implementation) of unification with binders☆14Updated last month
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆34Updated 5 years ago