The Optimal Implementation of Functional Programming Languages: (Cambridge Tracts in Theoretical Computer Science)
By
Andrea Asperti (Author) Stefano Guerrini (Author)
Hardback
Available / dispatched within 1 - 2 weeks
Quantity
Description
All traditional implementation techniques for functional languages (mostly based on supercombinators, environments or continuations) 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 book, the first in 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 Levy 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.
More Details
- Contributor: Andrea Asperti
- Imprint: Cambridge University Press
- ISBN13: 9780521621120
- Number of Pages: 408
- Packaged Dimensions: 152x229x27mm
- Packaged Weight: 770
- Format: Hardback
- Publisher: Cambridge University Press
- Release Date: 1998-12-03
- Series: Cambridge Tracts in Theoretical Computer Science
- Binding: Hardback
Delivery Options
Home Delivery
Store Delivery
Free Returns
We hope you are delighted with everything you buy from us. However, if you are not, we will refund or replace your order up to 30 days after purchase. Terms and exclusions apply; find out more from our Returns and Refunds Policy.