The duality of computation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2000

The duality of computation

Hugo Herbelin
  • Function : Author
  • PersonId : 833422
Pierre-Louis Curien
  • Function : Author
  • PersonId : 840786


We present the lambda-bar-mu-mu-tilde-calculus, a syntax for lambda-calculus + control operators exhibiting symmetries such as program/context and call-by-name/call-by-value. This calculus is derived from implicational Gentzen's sequent calculus LK, a key classical logical system in proof theory. Under the Curry-Howard correspondence between proofs and programs, we can see LK, or more precisely a formulation called LK-mu-mu-tilde, as a syntax-directed system of simple types for lambda-bar-mu-mu-tilde-calculus. For lambda-bar-mu-mu-tilde-calculus, choosing a call-by-name or call-by-value discipline for reduction amounts to choosing one of the two possible symmetric orientations of a critical pair. Our analysis leads us to revisit the question of what is a natural syntax for call-by-value functional computation. We define a translation of lambda-mu-calculus into lambda-bar-mu-mu-tilde-calculus and two dual translations back to lambda-calculus, and we recover known CPS translations by composing these translations.
Fichier principal
Vignette du fichier
icfp-CuHer00-duality_errata.pdf (211.76 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00156377 , version 1 (20-06-2007)


  • HAL Id : inria-00156377 , version 1


Hugo Herbelin, Pierre-Louis Curien. The duality of computation. Fifth ACM SIGPLAN International Conference on Functional Programming : ICFP '00, Sep 2000, Montréal, Canada. pp.233-243. ⟨inria-00156377⟩
602 View
546 Download


Gmail Facebook X LinkedIn More