The Vectorial Lambda-Calculus

Abstract : We describe a type system for the linear-algebraic lambda-calculus. The type system accounts for the linear-algebraic aspects of this extension of lambda-calculus: it is able to statically describe the linear combinations of terms that will be obtained when reducing the programs. This gives rise to an original type theory where types, in the same way as terms, can be superposed into linear combinations. We prove that the resulting typed lambda-calculus is strongly normalising and features a weak subject reduction. Finally, we show how to naturally encode matrices and vectors in this typed calculus.
Document type :
Journal articles
Complete list of metadatas
Contributor : Alejandro Díaz-Caro <>
Submitted on : Thursday, December 19, 2013 - 4:10:48 PM
Last modification on : Tuesday, November 19, 2019 - 2:45:09 AM

Links full text



Pablo Arrighi, Alejandro Díaz-Caro, Benoît Valiron. The Vectorial Lambda-Calculus. Information and Computation, Elsevier, 2017, 254 (1), pp.105-139. ⟨10.1016/j.ic.2017.04.001⟩. ⟨hal-00921087⟩



Record views