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

lmcs:2274 - Logical Methods in Computer Science, April 21, 2005, Volume 1, Issue 1 - https://doi.org/10.2168/LMCS-1(1:4)2005
Contextual equivalence for higher-order pi-calculus revisitedArticle

Authors: Alan Jeffrey ; Julian Rathke

    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.


    Volume: Volume 1, Issue 1
    Published on: April 21, 2005
    Submitted on: September 17, 2004
    Keywords: Computer Science - Programming Languages
    Funding:
      Source : OpenAIRE Graph
    • Collaborative Research: Temporal Aspects; Funder: National Science Foundation; Code: 0430175

    32 Documents citing this article

    Consultation statistics

    This page has been seen 962 times.
    This article's PDF has been downloaded 304 times.