The Optimal Implementation of Functional Programming Languages [Hardcover]

First account of the subject by two of its leading exponents. Essentially self-contained.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 its mathematical underpinnings. 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.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 its mathematical underpinnings. 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.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 Lévy and to Girard's more recent Geometry of Intls>