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

@inproceedings{Bakel2009ALI,
  title={A Logical Interpretation of the $\lambda$-Calculus into the $\pi$-Calculus, Preserving Spine Reduction and Types},
  author={Steffen van Bakel and Maria Grazia Vigliotti},
  booktitle={CONCUR},
  year={2009}
}
We define a new, output-based encoding of the λ -calculus into the asynchronous η -calculus --- enriched with pairing --- that has its origin in mathematical logic, and show that this encoding respects one-step spine-reduction up to substitution, and that normal substitution is respected up to similarity. We will also show that it fully encodes lazy reduction of closed terms, in that term-substitution as well as each reduction step are modelled up to similarity. We then define a notion of type… 
Implicative Logic based encoding of the λ-calculus into the π-calculus
TLDR
All the main properties (soundness, completene ss, and adequacy) hold for these four notions of reduction, as well as that termination is preserved.
Implicative Logic based translations of the λ-calculus into the π-calculus
TLDR
It is shown that all the main properties of reduction hold for these notions of reduction, as well as that termination is preserved with respect to a notion of call by need reduction for the π-calculus.
An output-based semantics of λ in π ( Extended Abstract )
We define a compositional output-based interpretation of the λ-calculus with explicit substitution into a variant of the π-calculus with pairing, and show that this interpretation preserves full
The π-calculus as a Universal Model of Computation
TLDR
The results show that the π-calculus is indeed a universal model of computation for both concurrent and sequential paradigms, and fully represents both parameter and context call, as well as functional composition.
An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
We study the Λμ-calculus, extended with explicit substitution, and define a compositional output-based translation into a variant of the π-calculus with pairing. We show that this translation
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.
Classical Cut-elimination in the π-calculus
We define a calculus LK a variant of the calculus X that enjoys the Curry-Howard correspondence for Gentzen’s calculus LK; the variant consists of allowing arbitrary progress of cut over cut . We
An output-based semantic interpretation of λ in π ( Extended Abstract )
TLDR
A compositional output-based interpretation of the λ-calculus with explicit substitution into a variant of the π-Calculus with pairing is defined, and it is shown that this interpretation preserves full single-stepβ-reduction with respect to contextual equi valence.
Classical Cut-elimination in the π-calculus ( In memory of Kohei Honda )
TLDR
It is shown that all proofs in LK have a representation in π, and that cut-elimination is effectively simulated by π’s synchronisation, congruence, and bisimilarity between processes.
Fully abstract semantics of λ μ in the π-calculus
TLDR
A logic-based compositional output-based translation into a variant of the π-calculus with pairing that preserves single-step explicit head reduction with respect to contextual equivalence is studied.
...
...

References

SHOWING 1-10 OF 47 REFERENCES
Functions as Processes
  • R. Milner
  • Computer Science, Mathematics
    Math. Struct. Comput. Sci.
  • 1992
This paper exhibits accurate encodings of the λ-calculus in the π-calculus. The former is canonical for calculation with functions, while the latter is a recent step [15] towards a canonical
From X to π From X to π Representing the Classical Sequent Calculus in π-calculus
TLDR
An encoding of proofs of Gentzen’s LK into the π-calculus, that respects cut-elimination as well as assignable types and preserves non-confluent nature of reduction in X /LK and the non-determinism of π.
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.
On the pi-Calculus and Linear Logic
An Investigation into Functions as Processes
TLDR
The primary goal of this paper is to continue the study of Milner's encodings, and shows that its encoding gives rise to a λ-model, in which a weak form of extensionality holds.
Categorical Structure of Continuation Passing Style
This thesis attempts to make precise the structure inherent in Continuation Passing Style (CPS). We emphasize that CPS translates λ-calculus into a very basic calculus that does not have functions as
The Language X : Circuits, Computations and Classical Logic (Extended Abstract)
TLDR
It is shown how, even in an untyped setting, X can faithfully embed algebraic objects and elaborate calculi, like the naturals, the λ-calculus, Bloe and Rose's calculus of explicit substitutions λx, and Parigot's λµ.
Strong Normalisation of Cut-Elimination in Classical Logic
TLDR
In this paper a strongly normalizing cut-elimination procedure is presented for classical logic and it is suggested that the symmetric reducibility candidates developed by Barbanera and Berardi should be adapted.
The lambda calculus - its syntax and semantics
  • H. Barendregt
  • Mathematics
    Studies in logic and the foundations of mathematics
  • 1985
Computation with classical sequents
TLDR
This paper presents the syntax and reduction rules for $\X$ and shows how elaborate calculi can be embedded, such as the λ-calculus, Bloo and Rose's calculus of explicit substitutions λx, Parigot's λμ and Curien and Herbelin's $\lmmt$.
...
...