Classical Call-by-need and duality

Zena Ariola (1) , Hugo Herbelin (2, 3) , Alexis Saurin (2, 3)

1 Department of Computer and Information Science
2 PPS - Preuves, Programmes et Systèmes
3 PI.R2 - Design, study and implementation of languages for proofs and programs

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.

Mots clés: call-by-need evaluation; control operators; duality; operational semantics; sequent calculus

Domaines: Langage de programmation [cs.PL]; Logique en informatique [cs.LO]

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⟩