On the semantics of the call-by-name CPS transform

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 309-321

  Boudol, Gérard ^a  

^a INRIA   (France)

Author keywords

B hm out technique; Continuation passing style transforms; L vy Longo trees; calculus

Indexed keywords

EID: 0012879375     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(99)00302-3     Document Type: Article

References (17)

1. H. Barendregt, The Lambda Calculus, Studies in Logic, vol. 103, Revised Edition, North-Holland, Amsterdam, 1984.
2. G. Boudol, C. Laneve, λ-Calculus, multiplicities and the π-calculus, in: G. Plotkin (Ed.), Proof, Language and Interaction, Essays in Honour of Robin Milner, MIT Press, Cambridge (2000) to appear.
3. G. Boudol, The π-calculus in direct style, Higher-Order Symbolic Comput. 11 (1998) 177-208.
4. C. Fournet, G. Gonthier, The reflexive CHAM, and the join calculus POPL'96, 1996, pp. 372-385.
5. J. Hatcliff, O. Danvy, Thunks and the λ-calculus, J. Functional Programming 7 (3) (1997) 303-320.
6. M. Hyland, A syntactic characterization of the equality in some models for the lambda calculus, J. London Math. Soc. 12 (2) (1976) 361-370.
7. J.-J. Levy, An algebraic interpretation of the λβΚ-calculus; and an application of a labelled λ-calculus, Theoret. Comput. Sci. 2 (1976) 97-114.
8. G. Longo, Set-theoretical models of λ-calculus: theories, expansions, isomorphisms, Ann. Pure Appl. Logic 24 (1983) 153-188.
9. R. Milner, The polyadic π-calculus: a tutorial, Te-chnical Report ECS-LFCS-91-180, Edinburgh University, 1991, in: F. Bauer, W. Brauer, H. Schwich-ten-berg (Eds.), Logic and Algebra of Specification, Reprinted, Springer, Berlin, 1993, pp. 203-246.
10. R. Milner, The polyadic π-calculus: a tutorial, Te-chnical Report ECS-LFCS-91-180, Edinburgh University, 1991, in: F. Bauer, W. Brauer, H. Schwich-ten-berg (Eds.), Logic and Algebra of Specification, Reprinted, Springer, Berlin, 1993, pp. 203-246.
11. R. Milner, Functions as processes, Math. Struct. Comp. Science 2 (1992) 119-141.
12. M. Odersky, Applying π: towards a basis for concurrent imperative programming, Proc. 2nd ACM SIGPLAN Workshop on State in Programming Languages, 1995.
13. G. Ostheimer, A. Davie, π-calculus characterizations of some practical λ-calculus reduction strategies, Techn. Report CS/93/14, University of St Andrews, 1993.
14. G. Plotkin, Call-by-name, call-by-value and the λ-cal-cu-lus, Theoret. Comput. Sci. 1 (1975) 125-159.
15. D. Sangiorgi, The lazy lambda-calculus in a concurrency scenario, Inform. Comput. 120 (1994) 120-153.
16. H. Thielecke, Categorical structure of continuation passing style, Ph.D. Thesis, Edinburgh University, 1997.
17. C. Wadsworth, The relation between computational and denotational properties for Scott D∞-models of the lambda-calculus, SIAM J. Comput. 5 (1976) 488-521.