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 3 months ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago
- Quasi-quoting library for agda☆17Updated 4 months ago
- ☆18Updated 2 years ago
- ☆23Updated 9 months ago
- Fintie Sets in Cubical Agda☆12Updated 5 years ago
- Agda code for experimenting with internal models of cubical type theory☆13Updated 7 years ago
- Repository holding code and latex sources for paper "Why Not W?"☆11Updated 4 years ago
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Experiments with preordered set models of (directed) type theories☆15Updated 5 years ago
- Mtac in Agda☆28Updated 3 years ago
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- Generalized syntax & semantics for universe hierarchies☆29Updated last year
- ☆15Updated 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
- ☆17Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- An extension of the NbE algorithm to produce computational traces☆21Updated 2 years ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- Co-inductive interaction trees provide a way to represent (potentially) non-terminating programs with I/O behavior.☆17Updated 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…☆20Updated 3 years ago
- Syntaxes with Binding, Their Programs, and Proofs☆23Updated last year
- A Redex model of CIC as specified in Chapter 4 of the Coq reference manual.☆34Updated 7 years ago
- Formalisation of a type unification algorithm in Coq proof assistant.☆19Updated 6 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆12Updated last year
- I'm putting Palmgren's Constructive Sheaf Semantics into Agda. Defines sheaves via Grothendieck pretopologies.☆17Updated 10 years ago
- my phd thesis☆26Updated 8 months ago
- Verified NbE via gluing in Agda☆11Updated 11 months ago
- Hacking synthetic Tait computability into Agda. Example: canonicity for MLTT.☆17Updated 4 years ago
- ☆18Updated 3 years ago