jonsterling / agda-synthetic-domain-theoryLinks
☆17Updated 3 years ago
Alternatives and similar repositories for agda-synthetic-domain-theory
Users that are interested in agda-synthetic-domain-theory are comparing it to the libraries listed below
Sorting:
- ☆15Updated last year
- my phd thesis☆26Updated 11 months ago
- ☆11Updated 5 years ago
- Mechanizations of Type Theories☆30Updated last week
- An extension of the NbE algorithm to produce computational traces☆22Updated 3 years ago
- Experiments with Realizability in Univalent Type Theory☆18Updated 8 months ago
- Verified NbE via gluing in Agda☆11Updated last year
- Research material of Erik Palmgren (1963–2019)☆20Updated 3 months ago
- Lecture notes and exercises for the advanced course on Categorical Realizability at the Midlands Graduate School (MGS) 2024 and the Europ…☆19Updated this week
- antifunext☆34Updated last year
- Formalization of normalization by evaluation for the fine-grain call-by-value language extended with algebraic effect theories☆15Updated 12 years ago
- Proof search for intuitionistic propositional logic using Dyckhoff's LJT.☆26Updated last year
- 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
- Extensions to the cubical stdlib category theory for categorical logic/type theory☆30Updated last month
- Bidirectional Binding Signature and Bidirectional Type Synthesis, Generically☆21Updated last year
- formalization of an equivariant cartesian cubical set model of type theory☆20Updated 6 months ago
- Quasi-quoting library for agda☆17Updated 7 months ago
- ☆21Updated 3 years ago
- Using Forester, We are attempting to resurrect and grow the since deleted model theory wiki and give it a better foundation for future gr…☆16Updated last month
- Agda formalisation of second-order abstract syntax☆55Updated 2 years ago
- Congruence Closure Procedure in Cubical Agda☆17Updated 4 years ago
- Simply-typed lambda calculus as a QIT in cubical Agda + normalization☆14Updated last year
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- ☆23Updated last year
- ☆16Updated 3 weeks ago
- A formalization of Pure Type Systems (PTS) in Agda☆26Updated last week
- ☆18Updated 3 years ago
- ☆14Updated last year
- ☆29Updated 2 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Updated 7 years ago