We propose a locally nameless representation for Launchbury's natural semantics for lazy evaluation. Names are reserved for free variables, while bound variable names are replaced by indices. This avoids the use of α-conversion and Barendregt's variable convention, and facilitates proof formalization. Our definition includes the management of multi-binders to represent simultaneous recursive local declarations. We use cofinite quantification to express the semantic rules that require the introduction of fresh names, but we show that existential rules are admissible too. Moreover, we prove that the choice of names during the evaluation of a term is irrelevant as long as they are fresh enough. © 2012 Springer-Verlag.
CITATION STYLE
Sánchez-Gil, L., Hidalgo-Herrero, M., & Ortega-Mallén, Y. (2012). A locally nameless representation for a natural semantics for lazy evaluation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7521 LNCS, pp. 105–119). https://doi.org/10.1007/978-3-642-32943-2_8
Mendeley helps you to discover research relevant for your work.