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...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2005-04-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/2274/pdf |
_version_ | 1797269949472833536 |
---|---|
author | Alan Jeffrey Julian Rathke |
author_facet | Alan Jeffrey Julian Rathke |
author_sort | Alan Jeffrey |
collection | DOAJ |
description | 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. |
first_indexed | 2024-04-25T01:56:30Z |
format | Article |
id | doaj.art-89458c9e2aee440fac787d0cb9fabd98 |
institution | Directory Open Access Journal |
issn | 1860-5974 |
language | English |
last_indexed | 2024-04-25T01:56:30Z |
publishDate | 2005-04-01 |
publisher | Logical Methods in Computer Science e.V. |
record_format | Article |
series | Logical Methods in Computer Science |
spelling | doaj.art-89458c9e2aee440fac787d0cb9fabd982024-03-07T17:10:13ZengLogical Methods in Computer Science e.V.Logical Methods in Computer Science1860-59742005-04-01Volume 1, Issue 110.2168/LMCS-1(1:4)20052274Contextual equivalence for higher-order pi-calculus revisitedAlan JeffreyJulian RathkeThe 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.https://lmcs.episciences.org/2274/pdfcomputer science - programming languages |
spellingShingle | Alan Jeffrey Julian Rathke Contextual equivalence for higher-order pi-calculus revisited Logical Methods in Computer Science computer science - programming languages |
title | Contextual equivalence for higher-order pi-calculus revisited |
title_full | Contextual equivalence for higher-order pi-calculus revisited |
title_fullStr | Contextual equivalence for higher-order pi-calculus revisited |
title_full_unstemmed | Contextual equivalence for higher-order pi-calculus revisited |
title_short | Contextual equivalence for higher-order pi-calculus revisited |
title_sort | contextual equivalence for higher order pi calculus revisited |
topic | computer science - programming languages |
url | https://lmcs.episciences.org/2274/pdf |
work_keys_str_mv | AT alanjeffrey contextualequivalenceforhigherorderpicalculusrevisited AT julianrathke contextualequivalenceforhigherorderpicalculusrevisited |