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.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Abadi, M., Cardelli, L., Curien, P.-L., Lévy, J.-J.: Explicit Substitutions. JFP 1(4), 375–416 (1991)
Abadi, M., Gordon, A.: A Calculus for Cryptographic Protocols: The Spi Calculus. In: CCS 1997, pp. 36–47 (1997)
Abramsky, S.: The lazy lambda calculus. Research topics in functional programming, pp. 65–116. Addison-Wesley (1990)
Audebaud, P.: Explicit Substitutions for the Λμ Calculus. RR 94-26, ÉNS de Lyon (1994)
van Bakel, S.: Completeness and Partial Soundness Results for Intersection & Union Typing for \(\bar{\lambda}{\mu}{\tilde{\mu}}\). Annals of Pure and Applied Logic 161, 1400–1430 (2010)
van Bakel, S.: Completeness and Soundness results for \(\cal X\) with Intersection and Union Types. Fundamenta Informaticae (to appear, 2012)
van Bakel, S., Barbanera, F., de’Liguoro, U.: A Filter Model for the λμ-Calculus. In: Ong, L. (ed.) TLCA 2011. LNCS, vol. 6690, pp. 213–228. Springer, Heidelberg (2011)
van Bakel, S., Cardelli, L., Vigliotti, M.G.: From \(\cal X\) to π; Representing the Classical Sequent Calculus in the π-calculus. In: CL&C 2008 (2008)
van Bakel, S., Lescanne, P.: Computation with Classical Sequents. MSCS 18, 555–609 (2008)
van Bakel, S., Vigliotti, M.G.: A Logical Interpretation of the λ-Calculus into the π-Calculus, Preserving Spine Reduction and Types. In: Bravetti, M., Zavattaro, G. (eds.) CONCUR 2009. LNCS, vol. 5710, pp. 84–98. Springer, Heidelberg (2009)
Barendregt, H.: The Lambda Calculus: its Syntax and Semantics. North-Holland (1984)
Bloo, R., Rose, K.H.: Preservation of Strong Normalisation in Named Lambda Calculi with Explicit Substitution and Garbage Collection. In: CSN 1995, pp. 62–72 (1995)
de Bruijn, N.G.: Lambda Calculus Notation with Nameless Dummies: A Tool for Automatic Formula Manipulation, with Application to the Church-Rosser Theorem. Ind. Math. 34, 381–392 (1972)
Church, A.: A Note on the Entscheidungsproblem. JSL 1(1), 40–41 (1936)
Cimini, M., Sacerdoti Coen, C., Sangiorgi, D.: \(\bar{\lambda}{\mu}{\tilde{\mu}}\) calculus, π-calculus, and abstract machines. In: EXPRESS 2009 (2009)
Crolard, T.: A confluent lambda-calculus with a catch/throw mechanism. JFP 9(6), 625–647 (1999)
Curien, P.-L., Herbelin, H.: The Duality of Computation. In: ICFP 2000, pp. 233–243. ACM (2000)
Gentzen, G.: Investigations into logical deduction. In: Szabo, M.E. (ed.) The Collected Papers of Gerhard Gentzen, p. 68. North Holland (1935, 1969)
de Groote, P.: On the Relation Between the λμ-Calculus and the Syntactic Theory of Sequential Control. In: Pfenning, F. (ed.) LPAR 1994. LNCS, vol. 822, pp. 31–43. Springer, Heidelberg (1994)
Herbelin, H.: C’est maintenant qu’on calcule: au cœur de la dualité. Mémoire d’habilitation, Université Paris 11 (2005)
Honda, K., Tokoro, M.: An Object Calculus for Asynchronous Communication. In: America, P. (ed.) ECOOP 1991. LNCS, vol. 512, pp. 133–147. Springer, Heidelberg (1991)
Honda, K., Yoshida, N., Berger, M.: Control in the π-Calculus. In: CW 2004 (2004)
Lassen, S.B.: Head Normal Form Bisimulation for Pairs and the λμ-Calculus. In: LICS 2006, pp. 297–306 (2006)
Milner, R.: Functions as processes. MSCS 2(2), 269–310 (1992)
Parigot, M.: An Algorithmic Interpretation of Classical Natural Deduction. In: Voronkov, A. (ed.) LPAR 1992. LNCS, vol. 624, pp. 190–201. Springer, Heidelberg (1992)
Parigot, M.: Strong Normalization for Second Order Classical Natural Deduction. In: LICS 1993, pp. 39–46 (1993)
Pierce, B.C., Sangiorgi, D.: Typing and Subtyping for Mobile Processes. MSCS 6(5), 409–453 (1996)
Py, W.: Confluence en λμ-calcul. Phd thesis, Univ. Savoie (1998)
Sangiorgi, D.: Expressing Mobility in Process Algebra: First Order and Higher Order Paradigms. PhD thesis, Univ. Edinburgh (1992)
Sangiorgi, D.: Lazy functions and mobile processes. RR 2515, INRIA, Sophia-Antipolis, France (1995)
Sangiorgi, D., Walker, D.: The Pi-Calculus. Cambridge University Press (2001)
Sestoft, P.: Demonstrating Lambda Calculus Reduction. In: Mogensen, T.Æ., Schmidt, D.A., Sudborough, I.H. (eds.) The Essence of Computation. LNCS, vol. 2566, pp. 420–435. Springer, Heidelberg (2002)
Wadsworth, C.P.: The relation between computational and denotational properties for Scott’s D ∞ -models of the lambda-calculus. SIAM JoC 5, 488–521 (1976)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 IFIP International Federation for Information Processing
About this paper
Cite this paper
van Bakel, S., Vigliotti, M.G. (2012). An Output-Based Semantics of Λμ with Explicit Substitution in the π-Calculus. In: Baeten, J.C.M., Ball, T., de Boer, F.S. (eds) Theoretical Computer Science. TCS 2012. Lecture Notes in Computer Science, vol 7604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33475-7_26
Download citation
DOI: https://doi.org/10.1007/978-3-642-33475-7_26
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-33474-0
Online ISBN: 978-3-642-33475-7
eBook Packages: Computer ScienceComputer Science (R0)