JonathanLorimer / conceptual-mathematics
Proofs for the exercises for Lawvere and Schanuel's Conceptual Mathematics
☆24Updated 2 years ago
Related projects: ⓘ
- A tutorial on how Agda infers things☆33Updated 3 years ago
- Agda category theory library for denotational design☆48Updated 3 months ago
- Basics of the dependently-typed functional language Agda ^_^☆37Updated 2 years ago
- Interpret Haskell programs into any cartesian closed category.☆57Updated 3 months ago
- Fast equality saturation in Haskell☆75Updated 4 months ago
- The theory of algebraic graphs formalised in Agda☆86Updated 6 years ago
- A non-interactive proof assistant using the Haskell type system☆35Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 3 months ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆55Updated 5 months ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆38Updated 2 years ago
- A work-in-progress core language for Agda, in Agda☆31Updated last week
- A Testing Framework for Lean☆41Updated last month
- Lecture notes and exercises for the introductory course on domain theory and denotational semantics at the Midlands Graduate School (MGS)…☆44Updated 6 months ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- The Agda Universal Algebra Library (html docs available at the url below)☆29Updated 3 months ago
- A toolkit for enforcing logical specifications on neural networks☆78Updated this week
- Ground Zero: Lean 4 HoTT Library☆41Updated last month
- Set up a specific version of Agda for your GitHub Actions workflow.☆26Updated 3 weeks ago
- Formalisations for simplicial HoTT and synthetic ∞-categories.☆43Updated 3 weeks ago
- They see me rollin'. They're Heyting. Patrollin' and tryna catch me ridin' dirty. -- Chamillionaire, 2005☆82Updated 3 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- ☆85Updated this week
- Braiding extensible effects together in a pipeline/workflow of tasks☆56Updated last year
- Lecture notes on realizability☆65Updated 5 months ago
- A slow-paced introduction to reflection in Agda. ---Tactics!☆91Updated 2 years ago
- high-performance cubical evaluation☆67Updated 2 months ago
- Learn the Agda basics in three 2-hour sessions.☆53Updated 10 months ago
- This aims to be the most pretentious implementation of stlc in existence☆60Updated 2 years ago
- Strongly-typed System F in Haskell☆117Updated last year