The Optimal Implementation of Functional Programming Languages
Series: Cambridge Tracts in Theoretical Computer Science; 45;
- Publisher's listprice GBP 80.00
-
40 488 Ft (38 560 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 20% (cc. 8 098 Ft off)
- Discounted price 32 390 Ft (30 848 Ft + 5% VAT)
Subcribe now and take benefit of a favourable price.
Subscribe
40 488 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Publisher Cambridge University Press
- Date of Publication 3 December 1998
- ISBN 9780521621120
- Binding Hardback
- No. of pages408 pages
- Size 229x152x27 mm
- Weight 770 g
- Language English 0
Categories
Short description:
First account of the subject by two of its leading exponents. Essentially self-contained.
MoreLong 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 L&&&233;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.
MoreTable 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.
More
