Typing linear algebra: A biproduct-oriented approach - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Science of Computer Programming Year : 2013

Typing linear algebra: A biproduct-oriented approach


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.
Fichier principal
Vignette du fichier
scp11.pdf (358.35 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00919866 , version 1 (17-12-2013)



Hugo Daniel Macedo, José N. Oliveira. Typing linear algebra: A biproduct-oriented approach. Science of Computer Programming, 2013, 78 (11), pp.2160-2191. ⟨10.1016/j.scico.2012.07.012⟩. ⟨hal-00919866⟩


740 View
929 Download



Gmail Facebook X LinkedIn More