mvr / atLinks
Effective Algebraic Topology in Haskell
☆90Updated last year
Alternatives and similar repositories for at
Users that are interested in at are comparing it to the libraries listed below
Sorting:
- comparative formalizations of the Yoneda lemma for 1-categories and infinity-categories☆71Updated last year
- An experimental category theory library for Lean☆51Updated 2 years ago
- Lecture notes on realizability☆75Updated 10 months ago
- Agda category theory library for denotational design☆54Updated 2 months ago
- Selected Papers of Dana S. Scott☆170Updated last year
- A work-in-progress core language for Agda, in Agda☆61Updated last week
- HoTT in Lean 3☆82Updated 5 years ago
- Ground Zero: Lean 4 HoTT Library☆74Updated 2 weeks ago
- Basics of the dependently-typed functional language Agda ^_^☆41Updated 3 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆40Updated 3 years ago
- Differential cohesion in Homotopy Type Theory by an axiomatized infinitesimal shape modality☆56Updated 3 years ago
- Categorical Logic Notes☆81Updated 3 years ago
- Categorical logic from a categorical point of view☆81Updated 2 years ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆84Updated 9 years ago
- Agda lecture notes for the Functional Programming course at TU Delft☆132Updated 5 months ago
- high-performance cubical evaluation☆77Updated 8 months ago
- apkg - package manager for Agda☆38Updated 4 years ago
- Latex documentation of our understanding of the synthetic /internal theory of the Zariski-Topos☆67Updated last week
- Schemes in Lean (v2)☆44Updated 5 years ago
- Datatypes as quotients of polynomial functors☆39Updated 5 years ago
- The theory of groups☆80Updated 2 years ago
- Template to effortlessly build math-rich websites☆39Updated 3 years ago
- Alg is a program that generates all finite models of a first-order theory. It is optimized for equational theories.☆84Updated 4 years ago
- Benchmarks for capture-avoiding substitution☆121Updated 6 months ago
- A (formalised) general definition of type theories☆59Updated 4 years ago
- ☆94Updated 8 months ago
- The Iowa Agda Library☆53Updated last month
- A non-interactive proof assistant using the Haskell type system☆38Updated 5 years ago
- Fast equality saturation in Haskell☆92Updated last week
- Agda formalisation of the Introduction to Homotopy Type Theory☆125Updated 4 years ago