Computer Science – Programming Languages
Scientific paper
2005-03-24
LMCS 1 (1:4) 2005
Computer Science
Programming Languages
Scientific paper
10.2168/LMCS-1(1:4)2005
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.
Jeffrey Alan
Rathke Julian
No associations
LandOfFree
Contextual equivalence for higher-order pi-calculus revisited does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Contextual equivalence for higher-order pi-calculus revisited, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Contextual equivalence for higher-order pi-calculus revisited will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-586717