mvr / at
Effective Algebraic Topology in Haskell
☆89Updated 5 months ago
Alternatives and similar repositories for at:
Users that are interested in at are comparing it to the libraries listed below
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆61Updated 3 months ago
- HoTT in Lean 3☆78Updated 4 years ago
- Lecture notes on realizability☆67Updated 4 months ago
- A Lean 4 library for configuring Command Line Interfaces and parsing command line arguments.☆73Updated last week
- Topos theory in lean☆58Updated 4 years ago
- Ground Zero: Lean 4 HoTT Library☆50Updated 2 months ago
- Schemes in Lean (v2)☆43Updated 4 years ago
- LaTeX code for a paper on lean's type theory☆129Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆53Updated 2 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆55Updated this week
- Synthetic geometry. Probably mostly algebraic geometry.☆23Updated last year
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 4 months ago
- Categorical logic from a categorical point of view☆77Updated last year
- A proof assistant for higher-dimensional type theory☆162Updated last week
- An experimental category theory library for Lean☆49Updated last year
- high-performance cubical evaluation☆69Updated 2 months ago
- Notes on how to use the internal language of toposes in algebraic geometry☆55Updated 2 months ago
- H.O.T.T. using rewriting in Agda☆40Updated 2 years ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago
- Datatypes as quotients of polynomial functors☆35Updated 4 years ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- A (formalised) general definition of type theories☆57Updated 3 years ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆98Updated 2 years ago