A fully-abstract semantics of lambda-mu in the pi-calculus
Logic in Computer Science
2016-02-22 v1
Abstract
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.
Cite
@article{arxiv.1409.3314,
title = {A fully-abstract semantics of lambda-mu in the pi-calculus},
author = {Steffen van Bakel and Maria Grazia Vigliotti},
journal= {arXiv preprint arXiv:1409.3314},
year = {2016}
}
Comments
In Proceedings CL&C 2014, arXiv:1409.2593