Skip to content
Cart

Your Cart

×

You have 0 items in your cart.

Register Sign in Wishlist
The Optimal Implementation of Functional Programming Languages

The Optimal Implementation of Functional Programming Languages

$116.00 (C)

Part of Cambridge Tracts in Theoretical Computer Science

  • Date Published: January 1999
  • availability: Available
  • format: Hardback
  • isbn: 9780521621120

$ 116.00 (C)
Hardback

Add to cart Add to wishlist

Looking for an examination copy?

If you are interested in the title for your course we can consider offering an examination copy. To register your interest please contact collegesales@cambridge.org providing details of the course you are teaching.

Description
Product filter button
Description
Contents
Resources
Courses
About the Authors
  • All traditional implementation techniques for functional languages fail to avoid useless repetition of work. They are not "optimal" in their implementation of sharing, often causing a catastrophic, exponential explosion in reduction time. Optimal reduction is an innovative graph reduction technique for functional expressions, introduced by Lamping in 1990, that solves the sharing problem. This work, the first on the subject, is a comprehensive account by two of its leading exponents. Practical implementation aspects are fully covered as are the mathematical underpinnings of the subject. The relationship to the pioneering work of Lévy and to Girard's more recent "Geometry of Interaction" are explored; optimal reduction is thereby revealed as a prime example of how a beautiful mathematical theory can lead to practical benefit. The book is essentially self-contained, requiring no more than basic familiarity with functional languages. It will be welcomed by graduate students and research workers in lambda calculus, functional programming or linear logic.

    • A highly innovative topic, presented by two specialists of the field
    • A nice example of application of a beautiful, complex theory to an important practical problem: sharing
    • A complete monograph: from theoretical to practical, implementation aspects
    Read more

    Customer reviews

    Not yet reviewed

    Be the first to review

    Review was not posted due to profanity

    ×

    , create a review

    (If you're not , sign out)

    Please enter the right captcha value
    Please enter a star rating.
    Your review must be a minimum of 12 words.

    How do you rate this item?

    ×

    Product details

    • Date Published: January 1999
    • format: Hardback
    • isbn: 9780521621120
    • length: 408 pages
    • dimensions: 229 x 152 x 27 mm
    • weight: 0.77kg
    • availability: Available
  • Table of Contents

    1. Introduction
    2. Optimal reduction
    3. The full algorithm
    4. Optimal reductions and linear logic
    5. Zig-zag
    6. Paths
    7. Read-back
    8. Other translations in sharing graphs
    9. Safe nodes
    10. Complexity
    11. Functional programming
    12. Source language
    Bibliography
    Index.

  • Authors

    Andrea Asperti, Università degli Studi, Bologna, Italy

    Stefano Guerrini, Université de Paris XIII

related journals

Sign In

Please sign in to access your account

Cancel

Not already registered? Create an account now. ×

Sorry, this resource is locked

Please register or sign in to request access. If you are having problems accessing these resources please email lecturers@cambridge.org

Register Sign in
Please note that this file is password protected. You will be asked to input your password on the next screen.

» Proceed

You are now leaving the Cambridge University Press website. Your eBook purchase and download will be completed by our partner www.ebooks.com. Please see the permission section of the www.ebooks.com catalogue page for details of the print & copy limits on our eBooks.

Continue ×

Continue ×

Continue ×

Find content that relates to you

This site uses cookies to improve your experience. Read more Close

Are you sure you want to delete your account?

This cannot be undone.

Cancel

Thank you for your feedback which will help us improve our service.

If you requested a response, we will make sure to get back to you shortly.

×
Please fill in the required fields in your feedback submission.
×