A theory of bisimulation for a fragment of concurrent ML with local names

Theoretical Computer Science

Volumn 323, Issue 1-3, 2004, Pages 1-48

  Jeffrey, Alan ^a   Rathke, Julian ^b  

^a DEPAUL UNIVERSITY   (United States)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Bisimulation; Concurrency; Higher order functions; Local names

Indexed keywords

C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER SIMULATION; JAVA PROGRAMMING LANGUAGE; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SYSTEMS ANALYSIS;

BISIMULATION; CONCURRENCY; HIGHER-ORDER FUNCTIONS; LOCAL NAMES;

CONCURRENCY CONTROL;

EID: 4243199081     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.03.005     Document Type: Article

References (33)

1. K.L. Bernstein, E.W. Stark, Operational semantics of a focussing debugger, in: Proc. MFPS 95, Electronic Notes in Computer Science, Vol. 1, Springer, Berlin, 1995.
2. D. Berry, R. Milner, D. Turner, A semantics for ML concurrency primitives, in: Proc. 19th ACM Symp. on Principles of Programmings Languages, 1992.
3. G. Boudol, Asynchrony and the π -calculus, Tech. Report 1702, INRIA, Sophia-Antipolis, 1991.
4. Boudol G. The. π -calculus in direct style Higher-order Symbolic Comput. 11:1998.
5. L. Cardelli, A. Gordon, Mobile ambients, in: Proc. FoSSaCS '98, Lecture Notes in Computer Science, Springer, Berlin, 1998.
6. Ferreira W., Hennessy M., Jeffrey A.S.A. A theory of weak bisimulation for core CML. J. Funct. Programming. 8(5):1998;447-491.
7. C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, in: Proc. ACM-POPL, 1996.
8. C. Fournet, G. Gonthier, A hierarchy of equivalences for asynchronous calculi, in: Proc. ICALP, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998.
9. C. Fournet, G. Gonthier, J.-J. Levy, L. Maranget, D. Remy, A calculus of mobile agents, in: Proc. CONCUR, Lecture Notes in Computer Science, Vol. 1119, Springer, Berlin, 1996.
10. A. Gordon, Bisimilarity as a theory of functional programming, in: Proc. MFPS 95, Electronic Notes in Computer Science, Vol. 1, Springer, Berlin, 1995.
11. A. Gordon, P.D. Hankin, A concurrent object calculus, in: Proc. HLCL, 1998.
12. K. Honda, M. Tokoro, An object calculus for asynchronous communication, in: Proc. ECOOP 91, Geneve, 1991.
13. Honda K., Yoshida N. On reduction-based process semantics. Theoret. Comput. Sci. 152(2):1995;437-486.
14. D. Howe, Equality in lazy computation systems, in: Proc. IEEE Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1989, pp. 198-203.
15. A.S.A. Jeffrey, J. Rathke, Towards a theory of bisimilarity for local names, in: Proc. IEEE Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 1999, pp. 56-66.
16. A.S.A. Jeffrey, J. Rathke, Towards a theory of bisimilarity for local names, in: Proc. IEEE Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2000, pp. 311-321.
17. A.S.A. Jeffrey, J. Rathke, A fully abstract may testing semantics for concurrent objects, in: Proc. IEEE Logic in Computer Science, IEEE Computer Society Press, Silver Spring, MD, 2002, pp. 101-112.
18. Leifer J.J., Milner R. Deriving bisimulation congruences for reactive systems. Palamidessi C. Proc. CONCUR 2000. Lecture Notes in Computer Science. Vol. 1877:2000;Springer, Berlin.
19. Milner R. A Calculus of Communicating Systems. Lecture Notes in Computer Science. Vol. 92:1980;Springer, Berlin.
20. Milner R. Communication and Mobile Systems: The. π -Calculus:1999;Cambridge University Press, Cambridge.
21. Milner R., Parrow J., Walker D. A calculus of mobile processes, part I + II. Inform. and Comput. 100(1):1992;1-77.
22. R. Milner, D. Sangiorgi, Barbed bisimulation, in: Proc. ICALP, Lecture Notes in Computer Science, Vol. 623, Springer, Berlin, 1992.
23. Moggi E. Notions of computation and monads. Inform. and Comput. 93:1991;55-92.
24. A.M. Pitts, I.D.B. Stark, Observable properties of higher order functions that dynamically create local names, or: what's new?, in: Proc. MFCS 93, Lecture Notes in Computer Science, Vol. 711, Springer, Berlin, 1993, pp. 122-141.
25. A.M. Pitts, I.D.B. Stark, Operational reasoning for functions with local state, in: A.D. Gordon, A.M. Pitts (Eds.), Higher Order Operational Techniques in Semantics, Cambridge University Press, Cambridge, 1998, Publications of the Newton Institute, pp. 227-273.
26. J. Reppy, Higher-order concurrency, Ph.D. Thesis, Cornell University, 1992, Technical Report TR 92-1285.
27. J. Riely, M. Hennessy, A typed language for distributed mobile processes, in: Proc. POPL, ACM Press, New York, 1998.
28. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, University of Edinburgh, 1993.
29. D. Sangiorgi, R. Milner, On the problem of 'weak bisimulation up to', in: Proc. CONCUR, Lecture Notes in Computer Science, Vol. 630, Springer, Berlin, 1992, pp. 32-46.
30. P. Sewell, From rewrite rules to bisimulation congruences, in: Proc. CONCUR, Lecture Notes in Computer Science, Vol. 1466, Springer, Berlin, 1992, pp. 269-284.
31. P. Sewell, Global/local subtyping and capability inference for a distributed π -calculus, in: Proc. ICALP, Lecture Notes in Computer Science, Vol. 1443, Springer, Berlin, 1998, pp. 695-706.
32. B. Thomsen, Calculi for higher-order communicating systems, Ph.D. Thesis, University of London, 1990.
33. Tofte M., Milner R., Harper R. The Definition of Standard ML. 1990;MIT Press, Cambridge, MA.