Work in progress
☆40Jun 7, 2025Updated 8 months ago
Alternatives and similar repositories for research
Users that are interested in research are comparing it to the libraries listed below
Sorting:
- A dependently typed type checker for a TT with intervals☆24Feb 6, 2020Updated 6 years ago
- Experiments with preordered set models of (directed) type theories☆15Jul 10, 2019Updated 6 years ago
- Interactive and object-oriented programming in Agda using coinductive types☆25Nov 29, 2025Updated 3 months ago
- A bare-bones LCF-style proof assistant☆25Aug 13, 2019Updated 6 years ago
- A tiny compiler for a security-typed imperative language with a formalised proof of noninterference-preservation.☆16Dec 10, 2019Updated 6 years ago
- Type Theory with Indexed Equality☆26Apr 7, 2017Updated 8 years ago
- Formalisation of the linear lambda calculus in Coq☆10Dec 2, 2018Updated 7 years ago
- ☆11Jul 20, 2016Updated 9 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆77Mar 5, 2022Updated 4 years ago
- All higher inductive types can be obtained from three simple HITs.☆17Apr 6, 2018Updated 7 years ago
- Experiments with effect systems☆12Apr 18, 2016Updated 9 years ago
- ☆12Jul 8, 2019Updated 6 years ago
- Observational Type Theory as an Agda library☆57May 27, 2017Updated 8 years ago
- Full implementation of F-ing Modules, with the power of sequent calculus☆20Mar 11, 2021Updated 4 years ago
- A version of Epigram 1 that can run with newer GHCs☆55Jul 22, 2017Updated 8 years ago
- An implementation of (some fragment of) cubical type theory using rewrite rules, based on a talk given by Conor McBride at the 23rd Agda'…☆12Aug 5, 2016Updated 9 years ago
- being a bidirectional reformulation of Martin-Löf's 1971 type theory☆25Sep 6, 2017Updated 8 years ago
- Collaborative work on reversible computing☆18Aug 3, 2022Updated 3 years ago
- Agda formalisation of NbE for λ□☆18Dec 5, 2017Updated 8 years ago
- Agda formalization of Intuitionistic Propositional Logic☆22Nov 14, 2025Updated 3 months ago
- ITT: quantified dependent calculus with inference of all modalities, implemented in Idris 2☆23Dec 5, 2024Updated last year
- A playground for type theory implementations in Racket☆20Dec 2, 2015Updated 10 years ago
- Formalization of Opetopes and Opetopic Sets in Agda☆18Dec 15, 2016Updated 9 years ago
- A polynomial model of a Martin-Löf type theory + a bit of game semantics☆31Dec 3, 2021Updated 4 years ago
- Mechanized Theory of Event Structures☆16Aug 16, 2023Updated 2 years ago
- Experiments in Synthetic Differential Geometry☆16Jul 1, 2021Updated 4 years ago
- "Programs that explain their effects" talk material☆17Jun 22, 2018Updated 7 years ago
- Semantics for Cryptol☆16Apr 9, 2018Updated 7 years ago
- Towards Optic-Based Algebraic Theories: the Case of Lenses☆17Nov 26, 2018Updated 7 years ago
- Library of the ##dependent distributed research support group☆119Jul 12, 2024Updated last year
- ☆26Feb 7, 2017Updated 9 years ago
- Agda programming with holes☆28Feb 2, 2021Updated 5 years ago
- Experimental type-checker for internally parametric type theory☆32Mar 27, 2025Updated 11 months ago
- Generalized syntax & semantics for universe hierarchies☆32Dec 11, 2023Updated 2 years ago
- Groupoids vs 1-Types☆11Nov 8, 2018Updated 7 years ago
- being a thing I build on a Saturday☆28Mar 5, 2018Updated 8 years ago
- Inline, type safe X86-64 assembly programming in Agda☆69Jan 3, 2019Updated 7 years ago
- Directed type theory for formal category theory☆17Apr 7, 2017Updated 8 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Apr 1, 2020Updated 5 years ago