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

@inproceedings{Bakel2014AFS,
  title={A fully-abstract semantics of lambda-mu in the pi-calculus},
  author={Steffen van Bakel and Maria Grazia Vigliotti},
  booktitle={CL\&C},
  year={2014}
}
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… 

Fully Abstract Encodings of $\lambda$-Calculus in HOcore through Abstract Machines

TLDR
This work presents fully abstract encodings of the call-by-name and call- by-value λ calculus into HOcore, a minimal higher-order process calculus with no name restriction, and considers several equivalences on the λ -calculus side that internalize into abstract machines in order to prove full abstraction of theencodings.

Fully abstract encodings of λ-calculus in HOcore through abstract machines

TLDR
Two fully abstract encodings of the call-byname λ-calculus are presented into HOcore, a minimal higher-order process calculus with no name restriction, to prove full abstraction.

Characterisation of Approximation and (Head) Normalisation for λμ using Strict Intersection Types

TLDR
A notion of approximants of lambda-mu-terms is defined, it is shown that it generates a semantics, and that for each typeable term there is an approximant that has the same type.

A Strong Bisimulation for Control Operators by Means of Multiplicative and Exponential Reduction

TLDR
This paper gives a translation of ΛM -terms into PPN which simulates the reduction relation of the authors' calculus via cut elimination of PPN, and establishes a precise correspondence between the relation ≃ and Laurent’s ≃σ -equivalence for λμ-terms.

Strong Bisimulation for Control Operators

The purpose of this paper is to identify programs with control operators whose reduction semantics are in exact correspondence. This is achieved by introducing a relation $\simeq$, defined over a

References

SHOWING 1-10 OF 30 REFERENCES

An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus - Extended Abstract

TLDR
A compositional output-based translation into a variant of the π-calculus with pairing is defined, and it is shown that this translation preserves single-step explicit head reduction with respect to contextual equivalence.

A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types

TLDR
A new, output-based encoding of the λ -calculus into the asynchronous η-calculus --- enriched with pairing --- is defined that respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity.

Head Normal Form Bisimulation for Pairs and the λμ-Calculus (Extended Abstract)

TLDR
This paper relates the extensional head normal form bisimulation theories for the different calculi via Fujita’s extensional CPS transform into the λFPcalculus and proves that extensional hnf bisimilarity is fully true.

Head Normal Form Bisimulation for Pairs and the \lambda\mu-Calculus

  • S. Lassen
  • Mathematics, Computer Science
    21st Annual IEEE Symposium on Logic in Computer Science (LICS'06)
  • 2006
TLDR
It is proved that extensional hnf bisimilarity is fully abstract for the pure lambda-calculus by a co-inductive reformulation of Barendregt's proof for Bohm tree equivalence up to possibly infinite eta expansion.

Functions as processes: termination and the λµµ-calculus

TLDR
It is proved that there is a tight relationship between such a machine and Curien and Herbelin's abstract machine for the λµµ-calculus.

Preservation of strong normalisation in named lambda calculi with explicit substitution and garbage collection

TLDR
It is shown that xgc is a conservative extension which preserves strong normalisation (PSN) of the untyped-calculus, which has two distinguishing features: rst, it retains the use of traditional variable names, specifying terms modulo renaming; this simpliies the reduction system.

Control in the π -Calculus

TLDR
Full abstraction is shown up to maximally consistent observational congruences in both calculi, and a tight operational correspondence assisted by the definability result opens a possibility to use typed π -calculi as a tool to investigate and analyse behaviours of various control operators and associated calculi in a uniform setting.

Representing the Classical Sequent Calculus in the π-calculus

We study theπ-calculus, enriched with pairing and non-blocking input, and define a notion of type assignment that uses the type c onstructor→. We encode the circuits of the calculus X into this

The lazy lambda calculus in a concurrency scenario

  • D. Sangiorgi
  • Mathematics
    [1992] Proceedings of the Seventh Annual IEEE Symposium on Logic in Computer Science
  • 1992
TLDR
It is shown that maximal discrimination is obtained when all operators are considered and that this discrimination coincides with the one given by Z+ and that the adoption of certain non-deterministic operators is sufficient and necessary to induce it.

On the Relation between the Lambda-Mu-Calculus and the Syntactic Theory of Sequential Control

TLDR
This work constructs a translation of first order λΜ-calculus into a subtheory of Felleisen's λc-Calculus, and shows that the two calculi are actually isomorphic.