| |
VOLUME 1, ISSUE 1, PAPER 4
|
Contextual equivalence for higher-order pi-calculus revisited
|
©Alan S. A. Jeffrey, Bell Labs, Lucent Technologies
©Julian Rathke, School of Informatics, University of Sussex
|
Abstract
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.
|
Publication date: April 21, 2005
Full Text: PDF | PostScript
DOI: 10.2168/LMCS-1(1:4)2005
Hit Counts: 5925 |
 Creative Commons | |
