A π-calciilus process semantics of concurrent idealised ALGOL

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1578, Issue , 1999, Pages 306-321

  Röckl, Christine ^a   Sangiorgi, Davide ^b  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGOL (PROGRAMMING LANGUAGE); COMPUTATION THEORY; SEMANTICS;

BISIMILARITY; HIGHER-ORDER; OPERATIONAL SEMANTICS; PI CALCULUS; PROCESS SEMANTICS;

CALCULATIONS;

EID: 84937683871     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-49019-1_21     Document Type: Conference Paper

References (30)

1. S. Arun-Kumar and M. Hennessy. An efficiency preorder for processes. Acta Informatica, 29:737-760, 1992.
2. S. Abramsky and G. McCusker. Linearity, sharing and state: a fully abstract game semantics for idealized algol with active expressions. Electronic Notes in Theoretical Computer Science, 3, 1996.
3. S. Abramsky and G. McCusker. Full abstraction for idealized algol with passive expressions. Submitted for Publication, 1997.
4. S. Brookes. The essence of parallel algol. In Proc. LICS’96. IEEE, 1996. App. in vol. 2 of [OT97].
5. M. Boreale and D. Sangiorgi. Bisimulation in name-passing calculi without matching. In thirteen LICS Gonf. IEEE Computer Society Press, 1998.
6. W. Ferreira, M. Hennessy, and A. Jeffrey. A theory of weak bisimulation for core CML.Technical report, School of Cognitive and Computing Sciences, University of Sussex, 1995.
7. M. Fiore, E. Moggi, and D. Sangiorgi. A fully-abstract model for the n- calculus. In 11th LICS. IEEE Computer Society Press, 1996.
8. K. Honda. Composing processes. In Proc. 23rd POPL. ACM Press, 1996.
9. J. Howe. Proving congruence of bisimulation in functional programming languages. Information and Computation, 124(2):103-112, 1996.
10. B. Jones. A π-calculus semantics for an object-based design notation. In Best, editor, Proc. CONCUR’93, volume 715 of LNCS, pages 158-172. Springer Verlag, 1993.
11. N. Kobayashi. A partially deadlock-free typed process calculus. In Proc. 12th LICS Gonf. IEEE Computer Society Press., 1997.
12. N. Kobayashi, B. C. Pierce, and D. N. Turner. Linearity and the π-calculus. In Proc. 23rd POPL. ACM Press, 1996.
13. J. Kleist and D. Sangiorgi. Imperative objects and mobile processes. In Proc. IFIP Working Conference on Programming Concepts and Methods (PRO- COMET’98). North-Holland, 1998.
14. R. Milner. Communication and Concurrency. Prentice-Hall, 1989.
15. R. Milner. The polyadic π-calculus: a tutorial. Technical Report ECS-LFCS- 91-180, LFCS, 1991.
16. R. Milner. Functions as processes. J. of Math. Struct, in Computer Science, 17:119-141, 1992.
17. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes. Report ECS-LFCS-89-85,86, Dept, of Computer Science, University of Edinburgh, 1989. Two volumes, also appeared in Information and Computation 100:1 77,1992.
18. A. R. Meyer and K. Sieber. Towards fully abstract semantics for local variables: preliminary report. In Proc. 15th POPL, 1988. Also appeared in vol. of [OT97]
19. R. Milner and D. Sangiorgi. The problem of weak bisimulation up-to. In Proc. CONCUR’92, volume 630 of LNCS. Springer, 1992.
20. I. A. Mason and C. L. Talcott. Equivalence in functional languages with effects. Technical report, University of Stanford, 1990.
21. I. A. Mason and C. L. Talcott. References, local variables and operational reasoning. Technical report, University of Stanford, 1990.
22. P. W. O’Hearn and R. D. Tennent. Parametricity and local variables. J. ACM, 42(3):658-709, 1995. Also appeared in [OT97].
23. P. W. O’Hearn and R. D. Tennent, editors. ALGOL-like Languages. Progress in Theoretical Computer Science. Birkhauser, 1997. Two volumes.
24. M. Pitts. Reasoning about local variables with operationally-based logical relations. In Proc. LICS’96. IEEE, 1996. Also appeared in vol. 2 of [OT97].
25. Pierce and D. Sangiorgi. Typing and subtyping for mobile processes. In Proc. LICS’93. IEEE, 1993. Also appeared in Mathematical Structures in Computer Science 6:5(1996) pp. 409-453.
26. J. C. Reynolds. The essence of ALGOL. In Algorithmic Languages, pages 345-372. North-Holland, 1981. Also appeared in vol. 1 of [OT97].
27. D. Sangiorgi. Lazy functions and mobile processes. Technical Report RR- 2515, INRIA-Sophia Antipolis, 1995. To appear in “Festschrift volume in honor of Robin Milner’s 60th birthday”, MIT Press.
28. Davide Sangiorgi. On the proof method for bisimulation (extended abstract). In Proc. MFCS’95, volume 969 of LNGS, pages 479-488. Springer Verlag, 1995. Full version available electronically.
29. Ian Stark. A fully abstract domain model for the π-calculus. In Proc. LICS’96, pages 36-42. IEEE Computer Society Press, 1996.
30. Walker. Objects in the π-calculus. Information and Computation, 116:253-271, 1995.