Control Reduction Theories: the Benefit of Structural Substitution - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Functional Programming Year : 2007

Control Reduction Theories: the Benefit of Structural Substitution


The historical design of the call-by-value theory of control relies on the reification of evaluation contexts as regular functions and on the use of ordinary term application for jumping to a continuation. To the contrary, the lambda-C-tp control calculus, developed by the authors, distinguishes between jumps and terms. This alternative calculus, which derives from Parigot's lambda-mu-calculus, works by direct "structural substitution" of evaluation contexts. We review and revisit the legacy theories of control and argue that lambda-C-tp provides an observationally equivalent but smoother theory. In an additional note contributed by Matthias Felleisen, we review the story of the birth of control calculi during the mid to late eighties at Indiana University.
Fichier principal
Vignette du fichier
jfp-AriHer07-lambda-C-tp.pdf (335.56 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00177320 , version 1 (07-10-2007)


  • HAL Id : inria-00177320 , version 1


Zena Ariola, Hugo Herbelin. Control Reduction Theories: the Benefit of Structural Substitution. Journal of Functional Programming, 2007. ⟨inria-00177320⟩
166 View
135 Download


Gmail Facebook Twitter LinkedIn More