Sangiorgi has shown that the semantics induced by Milner's encoding of the call-by-name -calculus in the -calculus is the equality of L vy-Longo trees. Later it was realized that Milner's encodings are actually variations on well-known continuation passing style transforms. Then a question is: is the discriminating ability due to -calculus features, or is it already o ered by the cps transform? We show that the latter is true: the semantics induced by the call-by-name cps transform on -terms is L vy-Longo trees equality.
Boudol REF proved that this is the case: the semantics induced by the call-by-name CPS transform on λ-terms is Lévy-Longo trees equality.
On the Semantics of the Call-by-Name CPS Transform
Theor. Comput. Sci.
Theor. Comput. Sci.
Mathematics Computer Science