Contextual equivalence for higher-order π-calculus revisited

Logical Methods in Computer Science

Volumn 1, Issue 1, 2005, Pages

  Jeffrey, Alan ^a   Rathke, Julian ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b UNIVERSITY OF SUSSEX   (United Kingdom)

Author keywords

Concurrency; Full abstraction; Higher order languages

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS;

BISIMULATIONS; CONCURRENCY; CONTEXTUAL EQUIVALENCE; FULL ABSTRACTION; HIGHER-ORDER LANGUAGES; LABELLED TRANSITION SYSTEMS; LABELLED TRANSITIONS; RECURSIVE TYPES;

CALCULATIONS;

EID: 85018089946     PISSN: None     EISSN: 18605974     Source Type: Journal    
DOI: 10.2168/LMCS-1(1:4)2005     Document Type: Article

References (15)

1. L. Cardelli and A. Gordon. Mobile ambients. In Proc. Foundations of Software Science and Computation Structures (FoSSaCS), Lecture Notes in Computer Science. Springer-Verlag, 1998.
2. C. Fournet and G. Gonthier. A hierarchy of equivalences for asynchronous calculi. In Proc. Int. Conf. Automata, Languages and Programming (ICALP), volume 1443 of Lecture Notes in Computer Science. Springer-Verlag, 1998.
3. C. Fournet, G. Gonthier, J-J. Levy, L. Maranget, and D. Remy. A calculus of mobile agents. In Proc. CONCUR, volume 1119 of Lecture Notes in Computer Science. Springer-Verlag, 1996.
4. A. Giacalone, P. Mishra, and S. Prasad. Facile: A symmetric integration of concurrent and functional programming. In Proc. TAPSOFT, volume 352 of Lecture Notes in Computer Science, pages 184-209. Springer-Verlag, 1989.
5. M. Hennessy and J. Rathke. Typed behavioural equivalences for processes in the presence of subtyping. In Proc. Computing: the Australasian Theory Symposium (CATS), Electronic Notes in Theoretical Computer Science. Elsevier, 2002.
6. K. Honda and N. Yoshida. On reduction-based process semantics. Theoretical Computer Science, 152(2):437-486, 1995.
7. A.S.A Jeffrey and J. Rathke. A theory of bisimulation for a fragment of Concurrent ML with local names. In Proc. IEEE Symp. Logic in Computer Science (LICS), pages 311-321. Computer Society Press, 2000.
8. A.S.A Jeffrey and J. Rathke. A fully abstract may testing semantics for concurrent objects. In Proc. IEEE Symp. Logic in Computer Science (LICS), pages 101-112. Computer Society Press, 2002.
9. J. Riely and M. Hennessy. A typed language for distributed mobile processes. In Proc. ACM Conf. Principles of Programming Languages (POPL). ACM Press, 1998.
10. D. Sangiorgi. Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms. PhD thesis, University of Edinburgh, 1993.
11. D. Sangiorgi. Bisimulation for higher-order process calculi. Information and Computation, 131(2):141-178, 1996.
12. D. Sangiorgi and R. Milner. On the problem of ‘weak bisimulation up to’. In Proc. CONCUR, volume 630 of Lecture Notes in Computer Science, pages 32-46. Springer-Verlag, 1992.
13. D. Sangiorgi and D. Walker. The pi-calculus: A Theory of mobile processes. Cambridge University Press, 2001.
14. B. Thomsen. Calculi for Higher-Order Communicating Systems. PhD thesis, University of London, 1990.
15. J. Vitek and G. Castagna. Seal: A framework for secure mobile computations. In Internet Programming Languages, volume 1686 of Lecture Notes in Computer Science. Springer-Verlag, 1999.