tomdjong / domain-theory-in-ufLinks
☆11Updated 5 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
Sorting:
- ☆15Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 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 9 years ago
- a version of the 2048 game for Coq☆22Updated 2 years ago
- Research material of Erik Palmgren (1963–2019)☆21Updated 8 months ago
- Mtac in Agda☆28Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 2 months ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆18Updated 7 years ago
- NbE course @ Chalmers☆28Updated last year
- Agda code for experimenting with internal models of cubical type theory☆15Updated 7 years ago
- my phd thesis☆26Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 8 years ago
- being the introduction to co-de-Bruijn metasyntax☆23Updated 3 years ago
- ☆18Updated 3 years ago
- Quasi-quoting library for agda☆18Updated last year
- Agda formalisation of NbE for λ□☆18Updated 8 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- ☆17Updated 3 years ago
- ☆23Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆31Updated 7 months ago
- Experiments with preordered set models of (directed) type theories☆15Updated 6 years ago
- Experiments with Realizability in Univalent Type Theory☆19Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 5 months ago
- ☆28Updated 5 years ago
- Logical relations proof in Agda☆27Updated 10 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Congruence Closure Procedure in Cubical Agda☆18Updated 5 years ago
- ☆21Updated 3 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Updated last month