An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus
Abstract
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 preserves single-step explicit head reduction with respect to contextual equivalence. We use this result to show operational soundness for head reduction, adequacy, and operational completeness. Using a notion of implicative type-context assignment for the π-calculus, we also show that assignable types are preserved by the translation. We finish by showing that termination is preserved.
Domains
Computer Science [cs]Origin | Files produced by the author(s) |
---|
Loading...