Electronic Proceedings in Theoretical Computer Science (Sep 2014)

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

  • Steffen van Bakel,
  • Maria Grazia Vigliotti

DOI
https://doi.org/10.4204/EPTCS.164.3
Journal volume & issue
Vol. 164, no. Proc. CL&C 2014
pp. 33 – 47

Abstract

Read online

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.