Picture 1 of 1

Stock photo

Optimal Implementation of Functional Programming Languages, Hardcover by Aspe... - Picture 1 of 1

Cambridge Tracts in Theoretical Computer Science Ser.: Optimal Implementation of Functional Programming Languages by Stefano Guerrini and Andrea Asperti (1998, Hardcover)

Great Book Prices Store (333004)

96.6% positive feedback

Price:

$104.76

Free shipping

Estimated delivery Sat, May 17 - Wed, May 28

Returns:

14 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.

Condition:

Brand New

This work, the first on the subject, is a comprehensive account by two of its leading exponents. Th is essentially self-contained, requiring no more than basic familiarity with functional languages.

About this product

Product Identifiers

PublisherCambridge University Press

ISBN-100521621127

ISBN-139780521621120

eBay Product ID (ePID)366958

Product Key Features

Number of Pages408 Pages

Publication NameOptimal Implementation of Functional Programming Languages

LanguageEnglish

SubjectProgramming Languages / General

Publication Year1998

TypeTextbook

AuthorStefano Guerrini, Andrea Asperti

Subject AreaComputers

SeriesCambridge Tracts in Theoretical Computer Science Ser.

FormatHardcover

Dimensions

Item Height1.1 in

Item Weight27.3 Oz

Item Length9 in

Item Width6 in

Additional Product Features

Intended AudienceScholarly & Professional

LCCN97-051550

Dewey Edition21

TitleLeadingThe

Series Volume NumberSeries Number 45

IllustratedYes

Dewey Decimal005.1/3

Table Of Content1. 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.

SynopsisAll 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., 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., This book, the first in the subject, is a comprehensive account of optimal reduction by two of its leading exponents. Practical implementation aspects are fully covered as are its mathematical underpinnings. 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., 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 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.