On Explicit Substitution with Names - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Automated Reasoning Year : 2012

On Explicit Substitution with Names


This paper recounts the origins of the λx family of calculi of explicit substitution with proper variable names, including the original result of preservation of strong β-normalization based on the use of synthetic reductions for garbage collection. We then discuss the properties of a variant of the calculus which is also confluent for "open" terms (with meta-variables), and verify that a version with garbage collection preserves strong β-normalization (as is the state of the art), and we summarize the relationship with other efforts on using names and garbage collection rules in explicit substitution.

Dates and versions

hal-00763399 , version 1 (10-12-2012)



Kristoffer H. Rose, Roel Bloo, Frederic Lang. On Explicit Substitution with Names. Journal of Automated Reasoning, 2012, Special Issue: Theory and Applications of Abstraction, Substitution and Naming, 49 (2), pp.275-300. ⟨10.1007/s10817-011-9222-5⟩. ⟨hal-00763399⟩
134 View
0 Download



Gmail Mastodon Facebook X LinkedIn More