Contextual equivalence for higher-order pi-calculus revisited

The higher-order pi-calculus is an extension of the pi-calculus to allow communication of abstractions of processes rather than names alone. It has been studied intensively by Sangiorgi in his thesis where a characterisation of a contextual equivalence for higher-order pi-calculus is provided using labelled transition systems and normal bisimulations. Unfortunately the proof technique used there requires a restriction of the language to only allow finite types. We revisit this calculus and offer an alternative presentation of the labelled transition system and a novel proof technique which allows us to provide a fully abstract characterisation of contextual equivalence using labelled transitions and bisimulations for higher-order pi-calculus with recursive types also.

[1]  Cédric Fournet,et al.  A Hierarchy of Equivalences for Asynchronous Calculi , 1998, ICALP.

[2]  Julian Rathke,et al.  Typed behavioural equivalences for processes in the presence of subtyping , 2002, Electron. Notes Theor. Comput. Sci..

[3]  Davide Sangiorgi,et al.  The Pi-Calculus - a theory of mobile processes , 2001 .

[4]  James Riely,et al.  A typed language for distributed mobile processes (extended abstract) , 1998, POPL '98.

[5]  Davide Sangiorgi,et al.  Expressing mobility in process algebras : first-order and higher-order paradigms , 1993 .

[6]  Jean-Jacques Lévy,et al.  A Calculus of Mobile Agents , 1996, CONCUR.

[7]  Jan Vitek,et al.  Seal: A Framework for Secure Mobile Computations , 1998, ICCL Workshop: Internet Programming Languages.

[8]  Luca Cardelli,et al.  Mobile Ambients , 1998, FoSSaCS.

[9]  Matthew Hennessy.  A Typed Language for Distributed Mobile Processes , 1998 .

[10]  Robin Milner,et al.  The Problem of "Weak Bisimulation up to" , 1992, CONCUR.

[11]  Julian Rathke,et al.  Typed behavioural equivalences for processes in the presence of subtyping , 2004, Math. Struct. Comput. Sci..

[12]  Bent Thomsen,et al.  A calculus of higher order communicating systems , 1989, POPL '89.

[13]  Nobuko Yoshida,et al.  On Reduction-Based Process Semantics , 1995, Theor. Comput. Sci..

[14]  Bent Thomsen,et al.  Calculi for higher order communicating systems , 1990 .

[15]  Davide Sangiorgi,et al.  Bisimulation for Higher-Order Process Calculi , 1994, Inf. Comput..

[16]  Julian Rathke,et al.  A theory of bisimulation for a fragment of concurrent ML with local names , 2004, Theor. Comput. Sci..

[17]  Julian Rathke,et al.  A fully abstract may testing semantics for concurrent objects , 2002, Proceedings 17th Annual IEEE Symposium on Logic in Computer Science.

[18]  Prateek Mishra,et al.  Facile: A symmetric integration of concurrent and functional programming , 1989, International Journal of Parallel Programming.