Main The Implementation of Functional Programming Languages

The Implementation of Functional Programming Languages

Name: The Implementation of Functional Programming Languages
Rating: 4.0 (4 reviews)
ISBN: 9780134533339

Simon L. Peyton Jones

4.0 / 5.0

0 comments

This book is about implementing functional programming languages using lazy graph reduction, and it divides into three parts. The first part describes how to translate a high-level functional language into an intermediate language, called the lambda calculus, including detailed coverage of pattern-matching and type-checking. The second part begins with a simple implementation of the lambda calculus, based on graph reduction, and then develops a number of refinements and alternatives, such as super- ½ombinators, full laziness and SK combinators. Finally, the third part describes the G-machine, a sophisticated implementation of graph reduction, which provides a dramatic increase in performance over the implementations described earlier. One of the agreed advantages of functional languages is their semantic simplicity. This simplicity has considerable payoffs in the book. Over and over again we are able to make semi-formal arguments for the correctness of the compilation algorithms, and the whole book has a distinctly mathematical flavor - an unusual feature in a book about implementations.

Request Code : ZLIBIO4398602

Categories:

Year:

1987

Publisher:

Prentice-Hall

Language:

English

Pages:

500

ISBN 10:

013453333X