jdolson / univalence-from-scratch
Univalence from scratch in Idris
☆19Updated 6 years ago
Related projects: ⓘ
- A library for doing generic programming in Agda☆28Updated 3 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- Linear Logic for Constructive Mathematics, in Agda☆18Updated 5 years ago
- The multimode presheaf proof-assistant☆35Updated last year
- ☆45Updated 5 years ago
- Where my everyday research happens☆53Updated 3 weeks ago
- Self-contained repository for the eponymous paper☆29Updated 5 years ago
- Observational Type Theory as an Agda library☆50Updated 7 years ago
- An approach to higher algebra in type theory☆23Updated 4 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Ministg is an interpreter for a high-level, small-step, operational semantics for the STG machine.☆71Updated 4 years ago
- Agda formalisation of second-order abstract syntax☆51Updated 2 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆68Updated 2 years ago
- being bits and pieces I'm inclined to leave lying around☆45Updated last month
- An experimental type checker for a modal dependent type theory.☆110Updated 4 years ago
- Tiny type-checker with dependent types☆76Updated 10 years ago
- Profunctor optics for the endofunctor category on Hask☆27Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 6 months ago
- ☆21Updated 2 months ago
- A formalized proof of a version of the initiality conjecture☆41Updated 4 years ago
- Implementing grep in Agda☆32Updated 3 years ago
- Formalization of Mathematics using Type Theory of Agda Programming Language☆11Updated 6 years ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆121Updated last month
- This is the place where (more or less) stable releases of my RW library will be published.☆16Updated 4 years ago
- A small implementation of a proof refinement logic.☆50Updated 7 years ago
- being the materials for "Datatypes of Datatypes" at the Summer School on Generic and Effectful Programming, Oxford☆19Updated 9 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆41Updated last month
- Idris Binary Integer Arithmetic, porting PArith, NArith, and ZArith from Coq☆36Updated 3 years ago
- What I wish I knew when learning HoTT☆52Updated 5 years ago