Classical Call-by-need and duality
Résumé
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.
Origine : Fichiers produits par l'(les) auteur(s)