The optimal implementation of functional programming languages
著者
書誌事項
The optimal implementation of functional programming languages
（Cambridge tracts in theoretical computer science, 45）
Cambridge University Press, 1998
大学図書館所蔵 件 / 全26件
-
該当する所蔵館はありません
- すべての絞り込み条件を解除する
注記
Bibliography: p. 383-389
Includes index
内容説明・目次
内容説明
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.
目次
- 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.
「Nielsen BookData」 より