Confluence via strong normalisation in an algebraic \lambda-calculus with rewriting
Logic in Computer Science
2012-03-29 v3
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.
Keywords
Cite
@article{arxiv.1102.0749,
title = {Confluence via strong normalisation in an algebraic \lambda-calculus with rewriting},
author = {Pablo Buiras and Alejandro Díaz-Caro and Mauro Jaskelioff},
journal= {arXiv preprint arXiv:1102.0749},
year = {2012}
}
Comments
In Proceedings LSFA 2011, arXiv:1203.5423