Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

On the dynamics of sharing graphs

  • Session 4: Semantics I
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1997)

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

Included in the following conference series:

Abstract

We provide a characterization of fan annihilation rules of Lamping's optimal algorithm through suitable paths on the initial graphs of the evaluation. This allows to recast the computational complexity issues of the algorithm in terms of statics. The fruitfulness of the path characterization is pointed out by proving the relationship between the computational complexity of the Krivine machine and Lamping's algorithm.

This work is partly supported by the ESPRIT CONFER-2 WG-21836

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.

Similar content being viewed by others

References

  1. A. Asperti. On the complexity of beta-reduction. In Proceedings 23 rd ACM Symposium on Principles of Programmining Languages, 1996.

    Google Scholar 

  2. A. Asperti, V. Danos, C. Laneve, and L. Regnier. Paths in the λ-calculus. In Proceedings 9 th Annual Symposium on Logic in Computer Science, Paris, pages 426–436, 1994.

    Google Scholar 

  3. A. Asperti and C. Laneve. Paths, computations and labels in the λ-calculus. Theoretical Computer Science, 142, 1995.

    Google Scholar 

  4. V. Danos and L. Regnier. Reversible and irreversible computations. Autumn 1994.

    Google Scholar 

  5. G. Gonthier, M. Abadi, and J.J. Lévy. The geometry of optimal lambda reduction. In Proceedings 19 th ACM Symposium on Principles of Programmining Languages, pages 15–26, 1992.

    Google Scholar 

  6. J. Lamping. An algorithm for optimal lambda calculus reductions. In Proceedings 17th ACM Symposium on Principles of Programmining Languages, pages 16–30, 1990.

    Google Scholar 

  7. J.L. Lawall and H.G. Mairson. Optimality and inefficiency: what isn't a cost model of the λ-calculus. In International Conference on Functional Programming, 1996. Philadelphia. Pennsylvania, USA.

    Google Scholar 

  8. J.J. Lévy. Réductions correctes et optimales dans le lambda calcul. PhD thesis, Université Paris VII, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dipartimento di Scienze dell'Informazione, Mura Anteo Zamboni 7, 40127, Bologna, Italy

    Andrea Asperti & 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

Pierpaolo Degano Roberto Gorrieri Alberto Marchetti-Spaccamela

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asperti, A., Laneve, C. (1997). On the dynamics of sharing graphs. In: Degano, P., Gorrieri, R., Marchetti-Spaccamela, A. (eds) Automata, Languages and Programming. ICALP 1997. Lecture Notes in Computer Science, vol 1256. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-63165-8_183

Download citation

  • DOI: https://doi.org/10.1007/3-540-63165-8_183

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63165-1

  • Online ISBN: 978-3-540-69194-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics