Skip to main content
SpringerLink
Log in

Comparing λ-calculus translations in sharing graphs

  • Conference paper
  • First Online:
Typed Lambda Calculi and Applications (TLCA 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 902))

Included in the following conference series:

Abstract

Since Lamping's seminal work [Lam90] on optimal graph reduction techniques for the λ-calculus, several different translations based on the same set of control operators (sharing graphs) have been proposed in the literature [GAL92a, GAL92b, AL93a, As94]. In this paper we clarify the correspondence between all these translations, passing through the so called bus-notation [GAL92a]. Indeed all the sharing graph encodings turn out to be equivalent modulo the way of counting bus levels.

Partially supported by the ESPRIT Basic Research Project 6454 — CONFER.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A. Asperti. Linear Logic, Comonads, and Optimal Reductions. To appear in Fundamenta Informaticae, Special Issue devoted to Categories in Computer Science. 1994.

    Google Scholar 

  2. A. Asperti, C. Laneve. Optimal Reductions in Interaction Systems. Proc. of the 4th Joint Conference on the Theory and Practice of Software Development, TAPSOFT'93, Orsay (France). April 1993.

    Google Scholar 

  3. A. Asperti, C. Laneve. Interaction System 2: The practice of optimal reductions. May 1993. A revised version of this paper may be got by anonymous ftp at cma.cma.fr as file pub/papers/cosimo/newIS2.ps.Z.

    Google Scholar 

  4. A. Asperti, V. Danos, C. Laneve, L. Regnier. Paths in the λ-calculus: three years of communications without understandings. Proc. of the 9th Annual Symposium on Logic in Computer Science (LICS 94), Paris 1994.

    Google Scholar 

  5. V. Danos, L. Regnier. Local and asynchronous beta-reduction. Proc. of the 8th Annual Symposium on Logic in Computer Science (LICS 93), Montreal. 1993.

    Google Scholar 

  6. J. Y. Girard. Linear Logic. Theoretical Computer Science, 50. 1986.

    Google Scholar 

  7. G. Gonthier, M. Abadi, J.J. Lévy. The geometry of optimal lambda reduction. Proc. of the 19th Symposium on Principles of Programming Languages (POPL 92). 1992.

    Google Scholar 

  8. G. Gonthier, M. Abadi, J.J. Lévy. Linear Logic without boxes. Proc. of the 7th Annual Symposium on Logic in Computer Science (LICS'92). 1992.

    Google Scholar 

  9. J. Lamping. An algorithm for optimal lambda calculus reductions. Proc. of the 17th Symposium on Principles of Programming Languages (POPL 90). San Francisco. 1990.

    Google Scholar 

  10. J.J. Levy. Réductions correctes et optimales dans le lambda-calcul. Thèse de doctorat d'état, Université de Paris VII. 1978.

    Google Scholar 

  11. L. Regnier. Lambda Calcul et Réseaux. Thèse de doctorat, Université Paris VII. 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Matematica, P.za di Porta S. Donato, 5, 40127, Bologna, Italy

    Andrea Asperti

  2. INRIA Sophia Antipolis, 2004 Route des Lucioles, BP 93, 06902, Valbonne, France

    Cosimo Laneve

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Cosimo Laneve
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Mariangiola Dezani-Ciancaglini Gordon Plotkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asperti, A., Laneve, C. (1995). Comparing λ-calculus translations in sharing graphs. In: Dezani-Ciancaglini, M., Plotkin, G. (eds) Typed Lambda Calculi and Applications. TLCA 1995. Lecture Notes in Computer Science, vol 902. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0014041

Download citation

  • DOI: https://doi.org/10.1007/BFb0014041

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-59048-4

  • Online ISBN: 978-3-540-49178-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation