On the Observational Theory of the CPS-calculus. (Extended Abstract)

Electronic Notes in Theoretical Computer Science

Volumn 158, Issue 1, 2006, Pages 307-330

  Merro, Massimo ^a   Biasi, Corrado ^b  

^a UNIVERSITY OF VERONA   (Italy)

^b QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

calculus; applicative bisimilarity; CPS transforms; up to bisimilarity proof technique; up to context

Indexed keywords

ABSTRACTING; COMPUTER SIMULATION; FORMAL LANGUAGES; SEMANTICS;

Π-CALCULUS; APPLICATIVE BISIMILARITY; CPS TRANSFORMS; UP TO BISIMILARITY PROOF TECHNIQUE; UP TO CONTEXT;

MATHEMATICAL TRANSFORMATIONS;

EID: 33646121779     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2006.04.016     Document Type: Article

References (55)

1. Abramsky S. The lazy lambda calculus. In: Turner D. (Ed). Research Topics in Functional Programming (1989), Addison-Wesley 65-116
2. Abramsky S., and Ong L. Full abstraction in the lazy lambda calculus. Information and Computation 105 (1993) 159-267
3. Appel A. Compiling with Continuations (1992), Cambridge University Press
4. Barendregt H. The Lambda Calculus: Its Syntax and Semantics. Studies in Logic volume 103 (1984), North Holland Revised edition
5. G. Berry. Some syntactic and categorical constructions of lambda calculus models. Technical Report RR-80, INRIA-Sophia Antipolis, 1981
6. Boudol G. Towards a lambda calculus for concurrent and communicating systems. Proc. TAPSOFT '89. LNCS volume 351 (1989), Springer Verlag 149-161
7. G. Boudol. Asynchrony and the π-calculus. Technical Report RR-1702, INRIA-Sophia Antipolis, 1992
8. Boudol G. The pi-calculus in direct style. Proc. 24th POPL (1997), ACM Press 228-241
9. Boudol G. On the semantics of the call-by-name CPS transforms. Theoretical Computer Science (2000) 309-321
10. Fischer M.J. Lambda-calculus schemata. Proceedings of ACM Conference on Proving Assertions about Programs. SIGPLAN Notice 7 1 (1972) 104-109
11. Fournet C., and Gonthier G. The Reflexive Chemical Abstract Machine and the Join calculus. Proc. 23th POPL (1996), ACM Press 372-385
12. Führmann C., and Thielecke H. On the Call-by-Value CPS transform and its semantics. Information and Computation 188 2 (2004) 241-283
13. A. D. Gordon. Bisimilarity as a theory of functional programming: mini-course. Notes Series BRICS-NS-95-3, BRICS, Department of Computer Science, University of Aarhus, July 1995
14. Honda K., and Tokoro M. An Object Calculus for Asynchronous Communications. Proc. ECOOP '91. LNCS volume 512 (1991), Springer Verlag
15. Howe D.J. Proving congruence of bisimulation in functional programming languages. Information and Computation 124 2 (1996) 103-112
16. Kennaway J.R., and Sleep M.R. Expressions as processes. Proc. ACM Conference on LISP and Functional Programming (1982), ACM 21-28
17. Koutavas V., and Wand M. Small bisimulations for reasoning about higher-order imperative programs. Proc. 33rd POPL (2006), ACM Press 141-152
18. Lassen S.B. Relational reasoning about contexts. Higher Order Operational Techniques in Semantics (1998), Cambridge University Press 91-135
19. Lassen S.B. Bisimulation in untyped lambda calculus: Böhm trees and bisimulation up to context. Proc. 15th MFPS. Electronic Notes in Theoretical Computer Science 20 (1999)
20. S.B. Lassen. Eager normal form bisimulation. In Proc. 20th LICS, 2005
21. L. Leth. Functional Programs as Reconfigurable Networks of Communicating Processes. Ph.D. thesis, Imperial College, University of London, 1991
22. Lévy J.J. An algebraic interpretation of the λβκ-calculus; and an application of a labelled λ-calculus. Theoretical Computer Science 2 1 (1976) 97-114
23. Longo G. Set theoretical models of lambda calculus: Theory, expansions and isomorphisms. Annales of Pure and Applied Logic 24 (1983) 153-188
24. Mac Lane S. Categories for the working mathematician. Graduate Texts in Mathematics. 2nd. edition edition (1998), Springer-Verlag
25. M. Merro and C. Biasi. On the observational theory of the CPS-calculus. Technical Report 40/2006, Dipartimento di Informatica - Università degli studi di Verona, Italy, April 2006. Available at http://www.di.univr.it/report
26. Merro M., and Zappa Nardelli F. Behavioral theory for mobile ambients. Journal of the ACM 52 6 (2005) 961-1023
27. Merro M., and Sangiorgi D. On asynchrony in name-passing calculi. Journal of Mathematical Structures in Computer Science 14 (2004) 715-767 An extended abstract appeared in the Proc. of ICALP'98
28. Milner R. Functions as processes. Journal of Mathematical Structures in Computer Science 2 2 (1992) 119-141 A prelimiinary versione appeared as INRIA-Research Report 1154, 1990
29. Milner R. Fully abstract models of typed lambda calculus. Theoretical Computer Science 4 (1977) 1-22
30. Milner R. Communication and Concurrency (1989), Prentice Hall
31. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS-91-180, LFCS, Dept. of Comp. Sci., Edinburgh Univ., October 1991
32. Also. In: Bauer F.L., Brauer W., and Schwichtenberg H. (Eds). Logic and Algebra of Specification (1993), Springer Verlag
33. Milner R., Parrow J., and Walker D. A calculus of mobile processes, (Parts I and II). Information and Computation 100 (1992) 1-77
34. Milner R., and Sangiorgi D. Barbed bisimulation. Proc. 19th ICALP. LNCS volume 623 (1992), Springer Verlag 685-695
35. J. Morris. Lambda-Calculus Models of Programming Languages. PhD thesis, Massachusetts Institute of Technology, 1968
36. Odersky M. Polarized name passing. Proc. FST&TCS. LNCS volume 1026 (1995), Springer Verlag
37. G.K. Ostheimer and A.J.T. Davie. π-calculus characterisations of some practical λ-calculus reductions strategies. Technical Report CS/93/14, St. Andrews, 1993
38. Park D.M. Concurrency on automata and infinite sequences. In: Deussen P. (Ed). Conf. on Theoretical Computer Science. LNCS volume 104 (1981), Springer Verlag
39. A. M. Pitts. An extension of Howe's construction to yield simulation-up-to-context results. Unpublished Manuscript, 1995
40. Pitts A.M. Operationally-based theories of program equivalence. In: Dybjer P., and Pitts A.M. (Eds). Semantics and Logics of Computation (1997), Publications of the Newton Institute, Cambridge University Press 241-298
41. Plotkin G.D. Call by name, call by value and the λ-calculus. Theoretical Computer Science 1 (1975) 125-159
42. G.D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI-FN-19, Computer Science Department, Aarhus University, 1981
43. Sabry A., and Felleisen M. Reasoning about programs in continuation-passing style. Lisp and Symbolic Computation 6 (1993) 289-360
44. Sands D. From SOS rules to proof principles: An operational metatheory for functional languages. Proc. 24th POPL (1997), ACM Press 428-441
45. Sangiorgi D. The lazy lambda calculus in a concurrency scenario. Information and Computation 111 1 (1994) 120-153
46. Sangiorgi D. Bisimulation for Higher-Order Process Calculi. Information and Computation 131 2 (1996) 141-178
47. Sangiorgi D. On the bisimulation proof method. Journal of Mathematical Structures in Computer Science 8 (1998) 447-479
48. Sangiorgi D., and Milner R. The problem of "Weak Bisimulation up to". Proc. CONCUR '92. LNCS volume 630 (1992), Springer Verlag 32-46
49. Sangiorgi D., and Walker D. Some results on barbed equivalences in pi-calculus. Proc. CONCUR '01. LNCS volume 2154 (2001), Springer Verlag
50. G. Steele. RABBIT: A compiler for SCHEME. Technical Report AITR-474, MIT Artificial Intelligence Laboratory, 1978
51. C. Strachey and P. Wadsworth. Continuations: A mathematical semantics for handling full jumps. Technical Report PRG-11, Oxford University Computing Laboratory, Programming Research Group, 1974
52. Strachey C., and Wadsworth P. Continuations: A mathematical semantics for handling full jumps. Higher-Order and Symbolic Computation 13 1/2 (2000) 135-152
53. H. Thielecke. Categorical Structure of Continuation Passing Style. PhD thesis, University of Edinburgh, 1997. Also available as technical report ECS-LFCS-97-376
54. B. Thomsen. Calculi for Higher Order Communicating Systems. PhD thesis, Department of Computing, Imperial College, 1990
55. W.P. Weijland. Synchrony and Asynchrony in Process Algebra. PhD thesis, University of Amsterdam, 1989