DeepRead
Cover of The Implementation of Functional Programming Languages

The Implementation of Functional Programming Languages

Simon L. Peyton Jones · 1987

Programming and computer science › Functional programming languages

#1,267 most recommended

About the book

A textbook on implementing lazy functional programming languages, covering the lambda calculus and combinators as the foundation, then graph reduction as the execution model. It is aimed at people building compilers or interpreters for languages in the style of Miranda and early Haskell. The central claim is that a lazy functional language can be compiled to an efficient abstract machine by representing programs as graphs and reducing them, with the sharing that laziness requires built into the representation. Supercombinators and the G-machine are presented as the practical route to that goal. The text also argues that static analysis such as strictness analysis can recover much of the performance lost to laziness, and it treats type checking as part of the implementation pipeline.

Written by Claude from what it knows of this book.

What Hacker News says 67% recommend · 3% critical

02.5520082015202020262014 peak · 5
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.

  • 3 want to read
  • 0 reading
  • 0 have read

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

The threads it came up in

Details

First published
1987
ISBN
9780134533339
Editions known
4 at Open Library
Open Library
OL4114710W

CompilerFunctional programming (computer science)Functional programming languagesFunktionale ProgrammierspracheImplementierungLangages de programmation fonctionnels

Explore in the mosaic

Read next: its neighbours on the mosaic