vix.ing · top · new · best · stats · spec

A fully-abstract semantics of lambda-mu in the pi-calculus

2014/09/11 by Steffen van Bakel, Maria Grazia Vigliotti
Computer Science · #cs.LO

paper · pdf · doi:10.4204/eptcs.164.3

published as EPTCS 164, 2014, pp. 33-47 · In Proceedings CL&C 2014, arXiv:1409.2593

arxiv created 2014/09/11 · arxiv updated 2016/02/22

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.

Citations