**Implementing Functional Languages: a tutorial**

by Simon Peyton Jones, David Lester

**Publisher**: Prentice Hall 1992**ISBN/ASIN**: B001UHUR8W**Number of pages**: 296

**Description**:

This book gives a practical approach to understanding implementations of non-strict functional languages using lazy graph reduction. The book is intended to be a source of practical labwork material, to help make functional-language implementations 'come alive', by helping the reader to develop, modify and experiment with some non-trivial compilers.

Download or read it online for free here:

**Download link**

(multiple formats)

## Similar books

**Formal Language Theory for Natural Language Processing**

by

**Shuly Wintner**-

**ESSLLI**

This text is a mild introduction to Formal Language Theory for students with little or no background in formal systems. The motivation is Natural Language Processing, and the presentation is geared towards NLP applications, with extensive examples.

(

**9204**views)

**Lectures on the Curry-Howard Isomorphism**

by

**Morten Heine B. Sorensen, Pawel Urzyczyn**-

**Elsevier Science**

This book give an introduction to parts of proof theory and related aspects of type theory relevant for the Curry-Howard isomorphism. It can serve as an introduction to any or both of typed lambda-calculus and intuitionistic logic.

(

**10063**views)

**Program Analysis (an Appetizer)**

by

**Flemming Nielson, Hanne Riis Nielson**-

**arXiv.org**

This is an introduction to program analysis that is meant to be elementary. Rather than using flow charts as the model of programs, the book uses program graphs as the model of programs. This makes the underlying ideas more accessible to students.

(

**1632**views)

**The Design and Implementation of Probabilistic Programming Languages**

by

**Noah D. Goodman, Andreas Stuhlmüller**-

**dippl.org**

This book explains how to implement PPLs by lightweight embedding into a host language. We illustrate this by designing WebPPL, a small PPL embedded in Javascript. We show how to implement several algorithms for universal probabilistic inference.

(

**4894**views)