Year: 2012
Type: article
Abstract: The linear-algebraic lambda-calculus and the algebraic lambda-calculus are untyped lambda-calculi extended with arbitrary linear combinations of terms. The former presents the axioms of linear algebra in the form of a rewrite system, while the latter uses equalities. When given by rewrites, algebraic lambda-calculi are not confluent unless further restrictions are added. We provide a type system for the linear-algebraic lambda-calculus enforcing strong normalisation, which gives back confluence. The type system allows an abstract interpretation in System F.
DOI: 10.4204/eptcs.81.2
Authors: Pablo Buiras, Alejandro Díaz-Caro, Mauro Jaskelioff
Institutions: National University of Rosario, Centre National de la Recherche Scientifique, Université Sorbonne Paris Nord, Laboratoire d'Informatique de Grenoble, Laboratoire d'Informatique de Paris-Nord, Pôle de recherche et d'enseignement supérieur Université de Grenoble, Université Grenoble Alpes, Centro Internacional Franco-Argentino de Ciencias de la Información y de Sistemas
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: diamond
Award: G3389333781
OpenAlex ID: W2051618179