Sprache: Englisch
Verlag: Cambridge University Press (edition 1), 1999
ISBN 10: 0521621127 ISBN 13: 9780521621120
Anbieter: BooksRun, Philadelphia, PA, USA
Hardcover. Zustand: Very Good. 1. It's a well-cared-for item that has seen limited use. The item may show minor signs of wear. All the text is legible, with all pages included. It may have slight markings and/or highlighting.
Anbieter: Revaluation Books, Exeter, Vereinigtes Königreich
EUR 154,94
Anzahl: 2 verfügbar
In den WarenkorbHardcover. Zustand: Brand New. 392 pages. 9.50x6.50x1.00 inches. In Stock.
Sprache: Englisch
Verlag: Cambridge University Press, 1999
ISBN 10: 0521621127 ISBN 13: 9780521621120
Anbieter: Majestic Books, Hounslow, Vereinigtes Königreich
EUR 178,34
Anzahl: 1 verfügbar
In den WarenkorbZustand: New. pp. 408 9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam.
Sprache: Englisch
Verlag: Cambridge University Press, 1999
ISBN 10: 0521621127 ISBN 13: 9780521621120
Anbieter: AHA-BUCH GmbH, Einbeck, Deutschland
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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é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.