Swapping: a natural bridge between named and indexed explicit substitution calculi

Ariel Mendelzon
(Departamento de Computación, FCEyN, Universidad de Buenos Aires)
Alejandro Ríos
(Departamento de Computación, FCEyN, Universidad de Buenos Aires)
Beta Ziliani
(Departamento de Computación, FCEyN, Universidad de Buenos Aires)

This article is devoted to the presentation of lambda_rex, an explicit substitution calculus with de Bruijn indexes and a simple notation. By being isomorphic to lambda_ex – a recent formalism with variable names –, lambda_rex accomplishes simulation of beta-reduction (Sim), preservation of beta-strong normalization (PSN) and meta-confluence (MC), among other desirable properties. Our calculus is based on a novel presentation of lambda_dB, using a swap notion that was originally devised by de Bruijn. Besides lambda_rex, two other indexed calculi isomorphic to lambda_x and lambda_xgc are presented, demonstrating the potential of our technique when applied to the design of indexed versions of known named calculi.

In Eduardo Bonelli: Proceedings 5th International Workshop on Higher-Order Rewriting (HOR 2010), Edinburgh, UK, July 14, 2010, Electronic Proceedings in Theoretical Computer Science 49, pp. 1–15.
Published: 17th February 2011.

ArXived at: https://dx.doi.org/10.4204/EPTCS.49.1 bibtex PDF
References in reconstructed bibtex, XML and HTML format (approximated).
Comments and questions to: eptcs@eptcs.org
For website issues: webmaster@eptcs.org