JonathanLorimer / conceptual-mathematics
Proofs for the exercises for Lawvere and Schanuel's Conceptual Mathematics
☆26Updated 3 years ago
Alternatives and similar repositories for conceptual-mathematics:
Users that are interested in conceptual-mathematics are comparing it to the libraries listed below
- A tutorial on how Agda infers things☆40Updated 4 years ago
- Lecture notes on realizability☆67Updated 4 months ago
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 7 months ago
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- A work-in-progress core language for Agda, in Agda☆44Updated 3 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- being the materials for Summer 2013's course☆112Updated last year
- high-performance cubical evaluation☆69Updated 2 months ago
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 10 months ago
- Agda formalisation of the Introduction to Homotopy Type Theory☆124Updated 3 years ago
- A Testing Framework for Lean☆50Updated last week
- Formal Topology in Univalent Foundations (WIP).☆35Updated 2 years ago
- Agda formalisation of second-order abstract syntax☆53Updated 2 years ago
- Formalizing linear algebra in Agda by representing matrices as functions☆26Updated last year
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 11 months ago
- This aims to be the most pretentious implementation of stlc in existence☆61Updated 2 years ago
- Demo for dependent types + runtime code generation☆66Updated 2 months ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆39Updated 2 years ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆48Updated 4 months ago
- Benchmarks for capture-avoiding substitution☆109Updated this week
- The Agda Universal Algebra Library (html docs available at the url below)☆31Updated 2 months ago
- An implementation of a simple Neural network in Idris using category theory.☆23Updated 4 months ago
- Interpret Haskell programs into any cartesian closed category.☆58Updated last month
- A slow-paced introduction to reflection in Agda. ---Tactics!☆98Updated 2 years ago
- Parser Combinator Library for Lean 4☆45Updated last week
- Ground Zero: Lean 4 HoTT Library☆50Updated 2 months ago
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago