ryanorendorff / functional-linear-algebra
Formalizing linear algebra in Agda by representing matrices as functions
☆26Updated last year
Alternatives and similar repositories for functional-linear-algebra:
Users that are interested in functional-linear-algebra are comparing it to the libraries listed below
- Basics of the dependently-typed functional language Agda ^_^☆39Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆46Updated 2 years ago
- Eventually a practical 2-level TT-based compiler☆27Updated last month
- A non-interactive proof assistant using the Haskell type system☆36Updated 4 years ago
- ⛏️ A refinement proof framework for haskell☆69Updated last year
- being the materials for Summer 2013's course☆112Updated last year
- Prototype implementations of systems based on setoid type theory☆65Updated 4 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆56Updated last year
- being a collection of Agda-facilitated ramblings☆33Updated 4 years ago
- Minimalistic dependent type theory with syntactic metaprogramming☆57Updated 9 months ago
- Tutorial series introducing Agda to the people at BCAM☆26Updated 3 years ago
- Agda category theory library for denotational design☆50Updated 9 months ago
- being the materials for a paper I have in mind to write about the bidirectional discipline☆49Updated 7 months ago
- A library for doing generic programming in Agda☆31Updated 4 years ago
- ☆47Updated 3 months ago
- Haskell embedding of PlusCal☆61Updated 2 years ago
- Idris port of Haskell's sop-core library☆34Updated last year
- An experimental implementation of homotopy type theory in the interactive proof assistant Isabelle☆34Updated 2 years ago
- Self-contained repository for the eponymous paper☆29Updated 6 years ago
- Haskell library for doing category theory with a central role for profunctors☆21Updated this week
- The theory of algebraic graphs formalised in Agda☆89Updated 6 years ago
- Haskell monad transformer for weighted, non-deterministic computation☆30Updated last month
- They see me rollin'. They're Heyting. -- Chamillionaire, 2005☆83Updated 3 years ago
- A Scope-and-Type Safe Universe of Syntaxes with Binding, Their Semantics and Proofs☆72Updated 3 years ago
- Unification and type inference algorithms☆125Updated 10 years ago
- Paper and talk☆51Updated last year
- Profunctor optics for the endofunctor category on Hask☆27Updated 4 years ago
- classical sequent calculus, embedded in Haskell☆19Updated 3 years ago
- Provides a type-safe way of working with permutations in Idris☆35Updated 3 years ago
- ☆30Updated 6 years ago