We are not able to resolve this OAI Identifier to the repository landing page. If you are the repository manager for this record, please head to the Dashboard and adjust the settings.
In order to prove the computational adequacy of the (operational)natural semantics for lazy evaluation with respect to a standard denotational semantics, Launchbury defines a resourced denotational semantics. This should be equivalent to the standard one when given infinite resources, but this fact cannot be so directly established, because each semantics produces values in a different domain. The values obtained by the standard semantics belong to the usual lifted function space D = [D → D]⊥, while those produced by the resourced semantics belong to [C → E] where E satisfies the equation E = [[C → E] → [C → E]]⊥ and C (the domain of resources) is a countable chain domain defined as the least solution of the domain equation C = C⊥.
We propose a way to relate functional values in the standard
lifted function space to functional values in the corresponding resourced function space. We first construct the initial solution for the domain equation E = [[C → E] →
[C → E]]⊥ following Abramsky’s construction of the initial
solution of D = [D → D]⊥. Then we define a “similarity”
relation between values in the constructed domain and values
in the standard lifted function space. This relation is
inspired by Abramsky’s applicative bisimulation.
Finally we prove the desired equivalence between the standard denotational semantics and the resourced semantics for the lazy λ-calculus.Comunidad de MadridMinisterio de Ciencia e Innovación (MICINN)Ministerio de EducaciónSección Deptal. de Sistemas Informáticos y ComputaciónFac. de Ciencias MatemáticasTRUEpu
Is data on this page outdated, violates copyrights or anything else? Report the problem now and we will take corresponding actions after reviewing your request.