ayberkt / formal-topology-in-UFLinks
Formal Topology in Univalent Foundations (WIP).
☆36Updated 3 years ago
Alternatives and similar repositories for formal-topology-in-UF
Users that are interested in formal-topology-in-UF are comparing it to the libraries listed below
Sorting:
- A formalized proof of a version of the initiality conjecture☆43Updated 5 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆54Updated last month
- The multimode presheaf proof-assistant☆36Updated 2 years ago
- ☆30Updated 2 years ago
- ☆29Updated 3 years ago
- antifunext☆34Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆46Updated last year
- Agda formalisation of second-order abstract syntax☆55Updated 3 years ago
- A work-in-progress core language for Agda, in Agda☆55Updated 2 weeks ago
- Mechanizations of Type Theories☆32Updated 2 months ago
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- ☆23Updated last year
- Eventually a practical 2-level TT-based compiler☆28Updated last week
- Correctness of normalization-by-evaluation for STLC☆23Updated 6 years ago
- Formalization of the polymorphic lambda calculus and its parametricity theorem☆35Updated 7 months ago
- A TACtic library for Agda☆50Updated last year
- A Unifying Cartesian Cubical Set Model☆34Updated 6 years ago
- Linear Logic for Constructive Mathematics, in Agda☆17Updated 6 years ago
- This aims to be the most pretentious implementation of stlc in existence☆65Updated 3 years ago
- NbE course @ Chalmers☆28Updated last year
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆54Updated 3 years ago
- A formalization of category theory in cubical Agda☆59Updated 5 years ago
- Synthetic geometry. Probably mostly algebraic geometry.☆25Updated last year
- A formalization of Pure Type Systems (PTS) in Agda☆27Updated 3 months ago
- Simple conversion from Agda text to literate Agda text.☆14Updated last month
- ☆45Updated 6 months ago
- ☆12Updated 7 months ago
- Formalizing nbe in agda☆31Updated 12 years ago
- being a particular fragment of Haskell, extended to a proof system☆42Updated 2 months ago
- Proof automation – for Agda, in Agda.☆44Updated 5 years ago