# Typing linear algebra: A biproduct-oriented approach

arXiv: https://arxiv.org/abs/1312.4818 · HTML: https://mlsanity.com/paper/1312.4818/

## Key facts

- Cited by 4 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 17 Dec 2013.

## Built on by (most cited first, 4 of 4)

- [Proximal Causal Learning with Kernels: Two-Stage Estimation and Moment Restriction](https://mlsanity.com/paper/2105.04544/) (2021)
- [Use of Variational Inference in Music Emotion Recognition](https://mlsanity.com/paper/2106.14323/) (2021)
- [Robust Egoistic Rigid Body Localization](https://mlsanity.com/paper/2501.10219/) (2025)
- [A Metric Topology of Deep Learning for Data Classification](https://mlsanity.com/paper/2501.11265/) (2025)

## Abstract (arXiv)

Interested in formalizing the generation of fast running code for linear algebra applications, the authors show how an index-free, calculational approach to matrix algebra can be developed by regarding matrices as morphisms of a category with biproducts. This shifts the traditional view of matrices as indexed structures to a type-level perspective analogous to that of the pointfree algebra of programming. The derivation of fusion, cancellation and abide laws from the biproduct equations makes it easy to calculate algorithms implementing matrix multiplication, the central operation of matrix algebra, ranging from its divide-and-conquer version to its vectorization implementation. From errant attempts to learn how particular products and coproducts emerge from biproducts, not only blocked matrix algebra is rediscovered but also a way of extending other operations (e.g. Gaussian elimination) blockwise, in a calculational style, is found. The prospect of building biproduct-based type checkers for computer algebra systems such as MatlabTM is also considered.