DeepRead
Cover of The optimal implementation of functional programming languages

The optimal implementation of functional programming languages

Andrea Asperti · 1998

Programming and computer science › Functional programming languages

#9,703 most recommended

About the book

The book covers optimal reduction for the lambda calculus and functional programming languages: evaluation strategies that avoid repeating work by sharing identical subcomputations across reduction steps. It spans the abstract theory of sharing and redex families, and the concrete graph-based implementations built on it. Its central claim is that optimal sharing, in the sense of Lévy's theory of redex families, can be realised in a working implementation and not only as an abstract ideal. It develops this through labelled reduction and sharing graphs, following Lamping's algorithm and the Gonthier, Abadi and Lévy theory. The book also treats the bookkeeping overhead of optimal reduction as a practical problem that the implementation has to address.

Written by Claude from what it knows of this book.

What Hacker News says 0% recommend · 0% critical

0122022202320242023 peak · 2
This bookAverage book in Functional programming languages

In the commenters’ own words

What Open Library readers say

No Open Library reader has rated it yet.

Open Library’s page for the book

What critics say, via Wikipedia

No Wikipedia article about this book yet, so no critics to quote.

Reddit communities — coming later

Details

First published
1998
ISBN
9780521621120
Editions known
2 at Open Library
Open Library
OL2753187W

Functional programming languagesProgramming languages (electronic computers)

Explore in the mosaic

Read next: its neighbours on the mosaic