Hostname: page-component-78c5997874-fbnjt Total loading time: 0 Render date: 2024-11-14T22:16:42.604Z Has data issue: false hasContentIssue false
  • English
  • Français

Thunks and the λ-calculus

Published online by Cambridge University Press:  01 May 1997

JOHN HATCLIFF  and
OLIVIER DANVY
JOHN HATCLIFF
Affiliation:
Computer Science Department, Copenhagen University; Universitetsparken 1, DK-2100 Copenhagen Ø, Denmark. e-mail: hatcliff@diku.dk
OLIVIER DANVY
Affiliation:
Computer Science Department, Aarhus University, Ny Munkegade, Building 540, DK-8000 Aarhus C, Denmark; e-mail: danvy@brics.dk
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

Thirty-five years ago, thunks were used to simulate call-by-name under call-by-value in Algol 60. Twenty years ago, Plotkin presented continuation-based simulations of call-by-name under call-by-value and vice versa in the λ-calculus. We connect all three of these classical simulations by factorizing the continuation-based call-by-name simulation [Cscr ]n with a thunk-based call-by-name simulation [Tscr ] followed by the continuation-based call-by-value simulation [Cscr ]v, extended to thunks.

formula here

We show that [Tscr ] actually satisfies all of Plotkin's correctness criteria for [Cscr ]n (i.e. his Indifference, Simulation and Translation theorems). Furthermore, most of the correctness theorems for [Cscr ]n can now be seen as simple corollaries of the corresponding theorems for [Cscr ]v and [Tscr ].

Type
Research Article
Information
Journal of Functional Programming , Volume 7 , Issue 3 , May 1997 , pp. 303 - 319
Copyright
© 1997 Cambridge University Press
Submit a response

Discussions

No Discussions have been published for this article.