A fully-abstract semantics of lambda-mu in the pi-calculus
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimilarity. We define four notions of weak equivalence...
Main Authors: | , |
---|---|
Format: | Article |
Language: | English |
Published: |
Open Publishing Association
2014-09-01
|
Series: | Electronic Proceedings in Theoretical Computer Science |
Online Access: | http://arxiv.org/pdf/1409.3314v1 |
id |
doaj-3bc3c474f43f44b98924d06805c32306 |
---|---|
record_format |
Article |
spelling |
doaj-3bc3c474f43f44b98924d06805c323062020-11-25T00:21:54ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802014-09-01164Proc. CL&C 2014334710.4204/EPTCS.164.3:1A fully-abstract semantics of lambda-mu in the pi-calculusSteffen van Bakel0Maria Grazia Vigliotti1 Imperial College London Adelard PLC We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimilarity. We define four notions of weak equivalence for lambda-mu – one based on weak reduction, two modelling weak head-reduction and weak explicit head reduction (all considering terms without weak head-normal form equivalent as well), and one based on weak approximation – and show they all coincide. We will then show full abstraction results for our interpretation for the weak equivalences with respect to weak bisimilarity on processes.http://arxiv.org/pdf/1409.3314v1 |
collection |
DOAJ |
language |
English |
format |
Article |
sources |
DOAJ |
author |
Steffen van Bakel Maria Grazia Vigliotti |
spellingShingle |
Steffen van Bakel Maria Grazia Vigliotti A fully-abstract semantics of lambda-mu in the pi-calculus Electronic Proceedings in Theoretical Computer Science |
author_facet |
Steffen van Bakel Maria Grazia Vigliotti |
author_sort |
Steffen van Bakel |
title |
A fully-abstract semantics of lambda-mu in the pi-calculus |
title_short |
A fully-abstract semantics of lambda-mu in the pi-calculus |
title_full |
A fully-abstract semantics of lambda-mu in the pi-calculus |
title_fullStr |
A fully-abstract semantics of lambda-mu in the pi-calculus |
title_full_unstemmed |
A fully-abstract semantics of lambda-mu in the pi-calculus |
title_sort |
fully-abstract semantics of lambda-mu in the pi-calculus |
publisher |
Open Publishing Association |
series |
Electronic Proceedings in Theoretical Computer Science |
issn |
2075-2180 |
publishDate |
2014-09-01 |
description |
We study the lambda-mu-calculus, extended with explicit substitution, and define a compositional output-based interpretation into a variant of the pi-calculus with pairing that preserves single-step explicit head reduction with respect to weak bisimilarity. We define four notions of weak equivalence for lambda-mu – one based on weak reduction, two modelling weak head-reduction and weak explicit head reduction (all considering terms without weak head-normal form equivalent as well), and one based on weak approximation – and show they all coincide. We will then show full abstraction results for our interpretation for the weak equivalences with respect to weak bisimilarity on processes. |
url |
http://arxiv.org/pdf/1409.3314v1 |
work_keys_str_mv |
AT steffenvanbakel afullyabstractsemanticsoflambdamuinthepicalculus AT mariagraziavigliotti afullyabstractsemanticsoflambdamuinthepicalculus AT steffenvanbakel fullyabstractsemanticsoflambdamuinthepicalculus AT mariagraziavigliotti fullyabstractsemanticsoflambdamuinthepicalculus |
_version_ |
1725360592121757696 |