DSLsofMath / FLABloMLinks
Functional Linear Algebra with Block Matrices
☆11Updated 3 years ago
Alternatives and similar repositories for FLABloM
Users that are interested in FLABloM are comparing it to the libraries listed below
Sorting:
- Deep embedding of imperative programs with code generation☆23Updated 3 years ago
- Agda-style equational reasoning in Haskell☆54Updated 8 months ago
- Tactic Metaprogramming in Haskell☆56Updated 6 years ago
- Desc'n crunch: Descriptions, levitation, and reflecting the elaborator.☆11Updated 6 years ago
- Where my everyday research happens☆55Updated last month
- λλλλ Lennart Augustsson's λ-calculus cooked four ways☆29Updated 4 years ago
- rewrite rules for type-level equalities☆62Updated 3 months ago
- An experimental intermediate language for GHC☆36Updated 8 years ago
- Category theory and algebra☆26Updated 9 years ago
- being a thing I build on a Saturday☆28Updated 7 years ago
- Standard module for type-level programming in Haskell☆31Updated 6 years ago
- An implementation of the Haskell ByteString library using the Fiat system from MIT☆34Updated 3 years ago
- Bidirectional programming in Haskell with monadic profunctors☆48Updated 3 years ago
- Mtac in Agda☆28Updated 4 years ago
- Implementing grep in Agda☆33Updated 4 years ago
- Self-contained repository for the eponymous paper☆30Updated 6 years ago
- Compositional type checking for Haskell☆38Updated 14 years ago
- Agda formalisation of dual-context constructive modal logics.☆20Updated 5 years ago
- Classes for types where we know all the values☆39Updated 11 months ago
- Recover run-time type information from the GHC heap. One example use case is a "show anything" function (with no Show constraint).☆35Updated 5 months ago
- 🖼️ the compiling to closed categories compiler☆66Updated 7 years ago
- Generic functions for single-sorted first-order structural unification☆45Updated 7 months ago
- Combinators for manipulating locally-nameless generalized de Bruijn terms☆127Updated last year
- higher-kinded data☆30Updated 2 years ago
- System F implemented in Haskell☆24Updated 13 years ago
- Specify variable binding in syntax trees using GHC.Generics (reimplementation of Unbound)☆57Updated last year
- Kleene algebra, regular expressions☆33Updated 2 years ago
- ☆31Updated 11 years ago
- Scrap Your Reprinter - A Datatype Generic Algorithm for Layout-Preserving Refactoring☆27Updated 4 years ago
- checkers for algebra driven design☆34Updated 3 years ago