ryanorendorff / functional-linear-algebra
Formalizing linear algebra in Agda by representing matrices as functions
☆25Updated 10 months ago
Related projects ⓘ
Alternatives and complementary repositories for functional-linear-algebra
- Bidirectional programming in Haskell with monadic profunctors☆44Updated 2 years ago
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆52Updated 7 years ago
- A fast, easy-to-use ring solver for agda with step-by-step solutions☆38Updated 2 years ago
- being the materials for Summer 2013's course☆110Updated last year
- Basics of the dependently-typed functional language Agda ^_^☆38Updated 2 years ago
- The theory of algebraic graphs formalised in Agda☆87Updated 6 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- The Agda Universal Algebra Library (html docs available at the url below)☆29Updated 5 months ago
- Where my everyday research happens☆53Updated last week
- A library for doing generic programming in Agda☆28Updated 3 years ago
- Linear Algebra of Programming - Algebraic Matrices in Haskell☆83Updated last year
- A tutorial on how Agda infers things☆36Updated 3 years ago
- being the teaching materials and exercises for CS410 in the 2018/19 session☆56Updated 5 years ago
- ☆28Updated 6 years ago
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- A talk☆28Updated 3 years ago
- Prototype implementations of systems based on setoid type theory☆64Updated 3 years ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆45Updated 3 months ago
- Algebra of Programming in Agda: Dependent Types for Relational Program Derivation☆78Updated 8 years ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 2 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated 8 months ago
- Convenient Haskell syntax for writing in LaTeX math expressions☆28Updated 8 months ago
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆55Updated 5 months ago
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated last year
- Interpret Haskell programs into any cartesian closed category.☆57Updated last week
- Quantitative Type Theory implementation☆54Updated 3 years ago
- Proof automation – for Agda, in Agda.☆44Updated 4 years ago
- Generic functions for single-sorted first-order structural unification☆41Updated this week