Classical Call-by-need and duality

Zena Ariola 1 Hugo Herbelin 2, 3 Alexis Saurin 2, 3
3 PI.R2 - Design, study and implementation of languages for proofs and programs
PPS - Preuves, Programmes et Systèmes, Inria Paris-Rocquencourt, UPD7 - Université Paris Diderot - Paris 7, CNRS - Centre National de la Recherche Scientifique : UMR7126
Abstract : We study call-by-need from the point of view of the duality between call-by-name and call-by-value. We develop sequent-calculus style versions of call-by-need both in the minimal and classical case. As a result, we obtain a natural extension of call-by-need with control operators. This leads us to introduce a call-by-need lambda-mu-calculus. Finally, by using the dualities principles of lambda-bar-mu-mu-tilde-calculus, we show the existence of a new call-by-need calculus, which is distinct from call-by-name, call-by-value and usual call-by-need theories.
Complete list of metadatas
Contributor : Hugo Herbelin <>
Submitted on : Friday, October 7, 2011 - 2:42:03 PM
Last modification on : Wednesday, August 21, 2019 - 2:56:01 PM
Long-term archiving on : Tuesday, November 13, 2012 - 3:26:21 PM


Files produced by the author(s)




Zena Ariola, Hugo Herbelin, Alexis Saurin. Classical Call-by-need and duality. TLCA 2011 - Typed Lambda Calculi and Applications, Silvia Ghilezan, Jun 2011, Novi Sad, Serbia. pp.27-44, ⟨10.1007/978-3-642-21691-6_6⟩. ⟨inria-00630156⟩



Record views


Files downloads