Contextual equivalence for higher-order pi-calculus revisited

Alan Jeffrey, Julian Rathke, Davide Sangiorgi
2005 Logical Methods in Computer Science  
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
more » ... 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.
doi:10.2168/lmcs-1(1:4)2005 fatcat:e3hzrnb6vfdjvlukazxfs4oigm