Skip to main content
Springer Nature Link
Log in

Optimal reduction of functional expressions

  • Conference paper
  • First Online:
Principles of Declarative Programming (ALP 1998, PLILP 1998)

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

  • 105 Accesses

Abstract

The usual implementations of functional programming languages based on a weak evaluation paradigm (no reduction inside a lambda), betray the very spirit, i.e. the higher-order nature, of lambda-calculus.

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

References

  1. A. Asperti, S.Guerrini The Optimal Implementation of Functional Programming Languages. To appear in the “Cambridge Tracts in Theoretical Computer Science” Series, Cambridge University Press, 1998.

    Google Scholar 

Download references

Author information

Authors and Affiliations

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

    Andrea Asperti

Authors
  1. Andrea Asperti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Catuscia Palamidessi Hugh Glaser Karl Meinke

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Asperti, A. (1998). Optimal reduction of functional expressions. In: Palamidessi, C., Glaser, H., Meinke, K. (eds) Principles of Declarative Programming. ALP PLILP 1998 1998. Lecture Notes in Computer Science, vol 1490. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0056630

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65012-6

  • Online ISBN: 978-3-540-49766-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation