Process calculus based upon evaluation to committed form

Theoretical Computer Science

Volumn 195, Issue 2, 1998, Pages 155-182

  Pitts, Andrew M ^a   Ross, Joshua R X ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

Bisimulation; Evaluation; Operational semantics; Process Calculus

Indexed keywords

EID: 0141435071     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00218-1     Document Type: Article

References (29)

1. S. Abramsky, The lazy λ-calculus, in: D.A. Turner (Ed.), Research Topics in Functional Programming, Ch. 4, Addison-Wesley, Reading, MA, 1990, pp. 65-117.
2. G. Berry, G. Boudol, The chemical abstract machine, Theoret. Comput. Sci. 96 (1992) 217-248.
3. W. Ferreira, M. Hennessy, A. Jeffrey, A theory of weak bisimulation for core CML, Tech. Report 05/95, Computer Science, University of Sussex, September 1995.
4. C. Fournet, G. Gonthier, The reflexive CHAM and the join-calculus, in: 23rd SIGPLAN-SIGACT Symp. on Principles of Programming Languages, ACM Press, New York, January 1996, pp. 372-385.
5. A. Giacalone, P. Mishra, S. Prasad, Facile: a symmetric integration of concurrent and functional programming, Internat. J. Parallel Programming 18 (2) (1989) 121-160.
6. R.J. van Glabbeek, W.P. Weijland, Branching time and abstraction in bisimulation semantics, J. ACM 43 (3) (1996) 555-600.
7. M. Hennessy, Algebraic Theory of Processes, MIT Press, New York, 1988.
8. K. Honda, M. Tokoro, On asynchronous communication semantics, in: M. Tokoro, O. Nierstrasz (Eds.), Proc. ECOOP'91 Workshop on Object-Based Concurrent Computing, Lecture Notes in Computer Science, vol. 612, Springer, Berlin, 1991, pp. 21-51.
9. K. Honda, N. Yoshida, On reduction-based process semantics, in: Proc. 13th Conf. on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, vol. 761, Springer, Berlin, 1993, pp. 371-387.
10. D.J. Howe, Equality in lazy computation systems, in: 4th Ann. Symp. on Logic in Computer Science, IEEE Computer Society Press, Washington, 1989, pp. 198-203.
11. D.J. Howe, Proving congruence of bisimulation in functional programming languages, Inform. Comput. 124 (2) (1996) 103-112.
12. P. Martin-Löf, Constructive mathematics and computer programming, in: Proc. 6th Internat. Congress for Logic, Methodology, and Philosophy of Science, North-Holland, Amsterdam, 1982, pp. 153-175.
13. R. Milner, A modal characterisation of observable machine-behaviour, in: Proc. CAAP'81, Lecture Notes in Computer Science, vol. 112, Springer, Berlin, 1981.
14. R. Milner, Communication and Concurrency, Prentice-Hall, Englewood Cliffs, NJ, 1989.
15. R. Milner, Functions as processes, in: Proc. 17th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 443, Springer, Berlin, 1990, pp. 167-180.
16. R. Milner, The polyadic π-calculus: a tutorial, in: F.L. Bauer et al. (Eds.), Logic and Algebra of Specification, Springer, Berlin, 1993.
17. R. Milner, J. Parrow, D. Walker, A calculus of mobile processes (Parts I and II), Inform. Comput. 100 (1992) 1-77.
18. R. Milner, D. Sangiorgi, Barbed bisimulation, in: W. Kuich (Ed.), Proc. 19th Internat. Coll. on Automata, Languages and Programming, Lecture Notes in Computer Science, vol. 623, Springer, Berlin, 1992, pp. 685-695.
19. R. Milner, M. Tofte, R. Harper, The Definition of Standard ML, MIT Press, Cambridge, MA, 1990.
20. C. Palamidessi, private communication, September 1996.
21. B.C. Pierce, D.N. Turner, Pict: a programming language based on the pi-calculus, to appear.
22. A.M. Pitts, J.R.X. Ross, Process calculus based upon evaluation to committed form, in: U. Montanari, V. Sassone (Eds.), CONCUR'96: Concurrency Theory, Proc. 7th Internat. Conf., Pisa, 1996., Lecture Notes in Computer Science, vol. 1119, Springer, Berlin, 1996, pp. 18-33.
23. G.D. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Aarhus University, 1981.
24. J. Reppy, CML: A higher-order concurrent language, in: Programming Language Design and Implementation, SIGPLAN, ACM, New York, June 1991, pp. 293-259.
25. D. Sangiorgi, Expressing mobility in process algebras: first-order and higher-order paradigms, Ph.D. Thesis, Department of Computer Science, University of Edinburgh, 1992.
26. D. Sangiorgi, On the bisimulation proof method, Tech. Report ECS-LFCS-94-299, Department of Computer Science, Edinburgh University, August 1994.
27. D. Sangiorgi, Bisimulation for higher-order process calculi, Tech. Report RR-2508, INRIA, April 1995.
28. B. Thomsen, Plain CHOCS. A second generation calculus for higher-order processes. Acta Inform. 30 (1) (1993) 1-59.
29. W.P. Weijland, Synchrony and asynchrony in process algebra, Ph.D. Thesis, Univ. Amsterdam, 1989.