benediktahrens / CT4P
☆34Updated 4 months ago
Alternatives and similar repositories for CT4P:
Users that are interested in CT4P are comparing it to the libraries listed below
- A work-in-progress core language for Agda, in Agda☆44Updated 4 months ago
- A tutorial on how Agda infers things☆41Updated 4 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- The Agda Universal Algebra Library (html docs available at the url below)☆33Updated 3 months ago
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- ☆29Updated 2 years ago
- Files related to my paper "Continuity of Godel's system T functionals via effectful forcing". MFPS'2013. Electronic Notes in Theoretical …☆11Updated 3 years ago
- A complete proof in Agda of the Church-Rosser theorem for untyped λ-calculus formalizing the methods by Komori-Matsuda-Yamakawa (2014) an…☆25Updated 2 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated last year
- ☆47Updated 3 months ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- Research material of Erik Palmgren (1963–2019)☆20Updated 2 years ago
- Learn the Agda basics in three 2-hour sessions.☆56Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- The Iowa Agda Library☆47Updated 3 months ago
- Lecture notes on realizability☆71Updated 2 weeks ago
- Agda formalisation of second-order abstract syntax☆54Updated 2 years ago
- A Logical Relation for Martin-Löf Type Theory in Agda☆49Updated 5 months ago
- A cost-aware logical framework, embedded in Agda.☆61Updated 7 months ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- ☆36Updated 3 years ago
- A verified compiler for a lazy functional language☆34Updated 3 weeks ago
- Experiments with higher-order abstract syntax in Agda☆20Updated 2 years ago
- ☆81Updated 6 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Meta-programming utilities for Agda.☆18Updated this week
- A proof of Abel-Ruffini theorem.☆28Updated this week