tomdjong / domain-theory-in-ufLinks
☆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
Sorting:
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- A formalization of Pure Type Systems (PTS) in Agda☆24Updated 5 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆14Updated 7 years ago
- Mtac in Agda☆28Updated 4 years ago
- ☆18Updated 3 years ago
- ☆17Updated 3 years ago
- Quasi-quoting library for agda☆17Updated 6 months ago
- ☆23Updated 11 months ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- ☆15Updated last year
- Haskell implementation of the Edinburgh Logical Framework☆30Updated last month
- 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
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- 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
- Simple conversion from Agda text to literate Agda text.☆14Updated 3 months ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- my phd thesis☆26Updated 10 months ago
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- ☆19Updated 3 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- a version of the 2048 game for Coq☆22Updated last year
- A library and case-study for linear, intrinsically-typed interpreters in Agda☆35Updated 5 years ago
- ☆29Updated 2 years ago
- Verified NbE via gluing in Agda☆11Updated last year
- NbE course @ Chalmers☆28Updated 9 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago