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
Lectures on the Curry-Howard Isomorphismby 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.
(6153 views)
Lecture Notes on the Lambda Calculusby Peter Selinger - Dalhousie University
Topics covered in these notes include the untyped lambda calculus, the Church-Rosser theorem, combinatory algebras, the simply-typed lambda calculus, the Curry-Howard isomorphism, weak and strong normalization, type inference, etc.
(6484 views)
Lecture Notes on Static Analysisby Michael I. Schwartzbach - IT University of Copenhagen
These notes present principles and applications of static analysis of programs. We cover type analysis, lattice theory, control flow graphs, dataflow analysis, fixed-point algorithms, narrowing and widening, control flow analysis, pointer analysis.
(2495 views)
Proofs and Typesby J. Girard, Y. Lafont, P. Taylor - Cambridge University Press
This little book comes from a short graduate course on typed lambda-calculus given at the Universite Paris. It is not intended to be encyclopedic and the selection of topics was really quite haphazard. Some very basic knowledge of logic is needed.
(11123 views)