Contextual equivalence for higher-order pi-calculus revisited
<|reference_start|>Contextual equivalence for higher-order pi-calculus revisited: 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.<|reference_end|>
@article{jeffrey2005contextual,
    title={Contextual equivalence for higher-order pi-calculus revisited},
    author={Alan Jeffrey and Julian Rathke},
    journal={Logical Methods in Computer Science, Volume 1, Issue 1 (April 21,
  2005) lmcs:2274},
    year={2005},
    doi={10.2168/LMCS-1(1:4)2005},
    archivePrefix={arXiv},
    eprint={cs/0503067},
    primaryClass={cs.PL}
}