|
Descripción
|
|
|---|---|
| Pure lambda calculus reduction strategies have been thoroughly studied, as they constitute the foundations of evaluation in many programming languages. Sestoft collected and defined several of them as sets of big-step rules, thus clarifying varying and inaccurate definitions in the literature. From Sestoft's work, we present a rule template which can instantiate any of the foremost strategies and some more. Abstracting the parameters of the template, we propose a space of reduction strategies we like to call the Beta Cube. We also formalise a hybridisation operator---informally suggested by Sestoft---which produces new strategies by composing a subsidiary and a base strategy from the cube. Furthermore, we discuss a variant of the hybridisation operator, in which the operand of an application is reduced by the subsidiary instead of the hybrid. This accomplish with the implicit remarks on Plotkin's theorems for the lambda-value calculus. The new hybridisation operator allows to produce a normalising strategy in Plotkin's (pure) lambda-value calculus. This space gives new and interesting insights about the properties of reduction strategies. We present and prove the Absorption Theorem, which states that subsidiaries are left-identities of their hybrids | |
|
Internacional
|
No |
|
Nombre congreso
|
Charla en el Programming, Logic and Semantics group |
|
Entidad organizadora
|
IT University |
|
Nacionalidad Entidad
|
DINAMARCA |
|
Lugar/Ciudad de impartición
|
Copenague |
|
Fecha inicio
|
07/03/2011 |
|
Fecha fin
|
07/03/2011 |