Isbn: 9780521621120 - the optimal implementation of functional programming languages hardback: 45 (cambridge tracts in theoretical computer science, series number 45) (19 resultados)

Condición: New.

Condición: New.

Condición: As New. Unread book in perfect condition.

Condición: New. In English.

Condición: New.

Condición: New. First account of the subject by two of its leading exponents. Essentially self-contained. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 408 pages, bibliography, index. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 27. Weight in Grams: 760. . 1998. hardcover. . . . .…

Condición: As New. Unread book in perfect condition.

Hardback. Condición: New. 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. …

hardcover. Condición: New. In shrink wrap. Looks like an interesting title.

Condición: New. First account of the subject by two of its leading exponents. Essentially self-contained. Series: Cambridge Tracts in Theoretical Computer Science. Num Pages: 408 pages, bibliography, index. BIC Classification: UMX; UYA. Category: (P) Professional & Vocational. Dimension: 228 x 152 x 27. Weight in Grams: 760. . 1998. hardcover. . . . . Books ship from the US and Ireland.…

Condición: New. pp. 408.

Hardcover. Condición: Brand New. 392 pages. 9.50x6.50x1.00 inches. In Stock.

Hardback. Condición: New. 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. …

Hardback. Condición: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.

Hardcover. Condición: new. Hardcover. 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. First account of the subject by two of its exponents. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.…

Condición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. 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.…

Condición: New. Print on Demand pp. 408 9:B&W 6 x 9 in or 229 x 152 mm Case Laminate on Creme w/Gloss Lam.

Condición: New. PRINT ON DEMAND pp. 408.

Buch. Condición: Neu. The Optimal Implementation of Functional Programming Languages | Andrea Asperti | Buch | Gebunden | Englisch | 2010 | Cambridge University Press | EAN 9780521621120 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand.…