Confluence via strong normalisation in an algebraic lambda-calculus with rewriting

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.
Type de document :
Communication dans un congrès
Simona Ronchi della Rocca and Elaine Pimentel. LSFA - 6th Workshop on Logical and Semantic Frameworks with Applications - 2011, Aug 2011, Belo Horizonte, Brazil. Open Publishing Association, 81, pp.16-29, 2012, Electronic Proceedings in Theoretical Computer Science. 〈10.4204/EPTCS.81.2〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00924938
Contributeur : Alejandro Díaz-Caro <>
Soumis le : mardi 7 janvier 2014 - 12:26:15
Dernière modification le : vendredi 10 août 2018 - 14:12:03

Lien texte intégral

Identifiants

Citation

Pablo Buiras, Alejandro Díaz-Caro, Mauro Jaskelioff. Confluence via strong normalisation in an algebraic lambda-calculus with rewriting. Simona Ronchi della Rocca and Elaine Pimentel. LSFA - 6th Workshop on Logical and Semantic Frameworks with Applications - 2011, Aug 2011, Belo Horizonte, Brazil. Open Publishing Association, 81, pp.16-29, 2012, Electronic Proceedings in Theoretical Computer Science. 〈10.4204/EPTCS.81.2〉. 〈hal-00924938〉

Partager

Métriques

Consultations de la notice

141