Distilling abstract machines

• Autores: Accattoli, Beniamino; Barenbaum, Pablo; Mazza, Damiano
• Año de publicación: 2014
• Idioma: inglés
• Tipo de recurso: artículo
• Materia: ABSTRACT MACHINES; CALL-BY-NEED; EXPLICIT SUBSTITUTIONS; LAMBDA-CALCULUS; LINEAR HEAD REDUCTION; LINEAR LOGIC
• Institución: Consejo Nacional de Investigaciones Científicas y Técnicas

It is well-known that many environment-based abstract machines can be seen as strategies in lambda calculi with explicit substitutions (ES). Recently, graphical syntaxes and linear logic led to the linear substitution calculus (LSC), a new approach to ES that is halfway between small-step calculi and traditional calculi with ES. This paper studies the relationship between the LSC and environment-based abstract machines. While traditional calculi with ES simulate abstract machines, the LSC rather distills them: some transitions are simulated while others vanish, as they map to a notion of structural congruence. The distillation process unveils that abstract machines in fact implement weak linear head reduction, a notion of evaluation having a central role in the theory of linear logic. We show that such a pattern applies uniformly in call-by-name, call-by-value, and call-by-need, catching many machines in the literature. We start by distilling the KAM, the CEK, and a sketch of the ZINC, and then provide simplified versions of the SECD, the lazy KAM, and Sestoft's machine. Along the way we also introduce some new machines with global environments. Moreover, we show that distillation preserves the time complexity of the executions, i.e. The LSC is a complexity-preserving abstraction of abstract machines.
Fil: Accattoli, Beniamino. Universidad de Bologna; Italia. University of Carnegie Mellon; Estados Unidos
Fil: Barenbaum, Pablo. Consejo Nacional de Investigaciones Científicas y Técnicas; Argentina. Universidad de Buenos Aires; Argentina
Fil: Mazza, Damiano. Centre National de la Recherche Scientifique; Francia. Universite de Paris 13-Nord; Francia