Jeffrey, Alan and Rathke, Julian - Contextual equivalence for higher-order pi-calculus revisited

lmcs:2274 - Logical Methods in Computer Science, April 21, 2005, Volume 1, Issue 1
Contextual equivalence for higher-order pi-calculus revisited

Authors: Jeffrey, Alan and Rathke, Julian

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.


Source : oai:arXiv.org:cs/0503067
DOI : 10.2168/LMCS-1(1:4)2005
Volume: Volume 1, Issue 1
Published on: April 21, 2005
Submitted on: September 17, 2004
Keywords: Computer Science - Programming Languages


Share

Consultation statistics

This page has been seen 46 times.
This article's PDF has been downloaded 27 times.