From rewrite to bisimulation congruences

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

Volumn 1466, Issue , 1998, Pages 269-284

  Sewell, Peter ^a  

^a UNIVERSITY OF CAMBRIDGE   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; DIFFERENTIATION (CALCULUS); PATHOLOGY; SEMANTICS;

ACTION CALCULUS; AMBIENT CALCULUS; BISIMULATION CONGRUENCES; BISIMULATIONS; LABELLED TRANSITION SEMANTICS; LABELLED TRANSITIONS; REDUCTION SEMANTICS; REWRITE RULES;

CALCULATIONS;

EID: 84945974793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0055628     Document Type: Conference Paper

References (37)

1. Martín Abadi and Andrew D. Gordon. A calculus for cryptographie protocols: The spi calculus. In Proceedings of the Fourth ACM Conference on Computer and Communications Security, Zürich, pages 36-47. ACM Press, April 1997.
2. S. Abramsky and L. Ong. Full abstraction in the lazy lambda calculus. Information and Computation, 105:159-267,1993.
3. Gérard Berry and Gérard Boudol. The chemical abstract machine. Theoretical Computer Science, 96:217-248,1992.
4. Karen L. Bernstein. A congruence theorem for structured operational semantics of higher-order languages. In Proceedings ofUCS 98,1998.
5. B. Bloom, S. Istrail, and A.R. Meyer. Bisimulation can’t be traced. Journal of the ACM, 42(1):232-268, January 1995.
6. Jean-Pierre Banaˆtre and Daniel Le Métayer. A new computational model and its discipline of programming. Technical Report 566, INRIA, 1986.
7. Gérard Boudol. The π-calculus in direct style. In Proceedings of the 24th POPL, pages 228-241,15-17 January 1997.
8. Luca Cardelli and Andrew D. Gordon. Mobile ambients. In Proc. of Foundations of Software Science and Computation Structures (FoSSaCS), ETAPS’98, March 1998.
9. R. De Nicola and M. C. B. Hennessy. Testing equivalences for processes. Theoretical Computer Science, 34:83-133,1984.
10. R. de Simone. Higher-level synchronising devices in MEIJE-SCCS. Theoretical Computer Science, 37:245-267,1985.
11. U. Engberg and M. Nielsen. A calculus of communicating systems with label-passing. Technical Report DAIMI PB-208, Comp. Sc. Department, Univ. of Aarhus, Denmark, 1986.
12. M. Felleisen and D. B Friedman. Control operators, the SECD-machine and the λ-calculus. In Formal Description of Programming Concepts III, pages 193-217. North Holland, 1986.
13. Cédric Fournet and Georges Gonthier. The reflexive CHAM and the join-calculus. In Proceedings of the 23rd POPL, pages 372-385. ACM press, January 1996.
14. William Ferreira, Matthew Hennessy, and Alan Jeffrey. A theory of weak bisimulation for core CML. In Proc. ACM SIGPLAN Int. Conf. Functional Programming. ACM Press, 1996.
15. R. J. van Glabbeek. The linear time - branching time spectrum. In Proceedings of CONCUR '90, LNCS 458, pages 278-297,1990.
16. R. J. van Glabbeek. The linear time - branching time spectrum II; the semantics of sequential systems with silent moves. In Proceedings of CONCUR’93, LNCS 715, pages 66-81,1993.
17. Fabio Gadducci and Ugo Montanari. The tile model. In Gordon Plotkin, Colin Stirling, and Mads Tofte, editors, Proof, Language and Interaction: Essays in Honour of Robin Milner. MIT Press, 1998. To appear.
18. Andrew D. Gordon. Bisimilarity as a theory of functional programming, mini-course. Number NS-95-3 in the BRICS Notes Series, Computer Science Department, Aarhus, 1995.
19. Andrew D. Gordon and Gareth D. Rees. Bisimilarity for a first-order calculus of objects with subtyping. In Proceedings of the 23rd POPL, pages 386-395,1996.
20. J.F. Groote and F.W. Vaandrager. Structured operational semantics and bisimulation as a congruence. Information and Computation, 100(2):202-260,1992.
21. Douglas J. Howe. Equality in lazy computation systems. In Proceedings ofLICS •89, pages 193-203,1989.
22. Kohei Honda and Nobuko Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2) :437-486,1995.
23. Ole Høgh Jensen. PhD thesis, University of Cambridge. Forthcoming, 1998.
24. Alex Mifsud. Control Structures. PhD thesis, University of Edinburgh, 1996.
25. Robin Milner. Functions as processes. Journal of Mathematical Structures in Computer Science, 2(2):119-141,1992.
26. Robin Milner. Calculi for interaction. Acta Informatica, 33:707-737,1996.
27. R. Milner, J. Parrow, and D. Walker. A calculus of mobile processes, Parts I + II. Information and Computation, 100(1): 1-77,1992.
28. Robin Milner and Davide Sangiorgi. Barbed bisimulation. In Proceedings of 19th ICALR LNCS 623, pages 685-695,1992.
29. J. Niehren and M. Mueller. Constraints for free in concurrent computation. In Proceedings of the Asian Computer Science Conference, LNCS 1023, pages 171-186,1995.
30. Gordon D. Plotkin. A structural approach to operational semantics. Technical Report DAIMI FN-19, Computer Science Department, Aarhus University, Aarhus, Denmark, 1981.
31. James Riely and Matthew Hennessy. A typed language for distributed mobile processes. In Proceedings of the 25th POPL, January 1998.
32. Davide Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993.
33. Peter Sewell. On implementations and semantics of a concurrent programming language. In Proceedings of CONCUR '97. LNCS 1243, pages 391-405,1997.
34. Peter Sewell. From rewrite rules to bisimulation congruences. Technical Report 444, University of Cambridge, June 1998. Available from http://www.cl.caun.ac.uk/users/pes20/.
35. Peter Sewell. Global/local subtyping and capability inference for a distributed π-calculus. In Proceedings oflCALP '98, LNCS, 1998.
36. th IJCS Confi, pages 280-291. IEEE, Computer Society Press, 1997.
37. Femke van Raamsdonk. Confluence and Normalisation for Higher-Order Rewriting. PhD thesis, Vrije Universiteit, Amsterdam, 1996.