Path: utzoo!utgpu!water!watmath!clyde!att!osu-cis!tut.cis.ohio-state.edu!mailrus!umich!kfr
From: kfr@zippy.eecs.umich.edu (Karl F. Ruehr)
Newsgroups: comp.lang.scheme
Subject: Re: Lambda Calculus Books
Message-ID: <1147@zippy.eecs.umich.edu>
Date: 12 Sep 88 23:21:16 GMT
References: <8809121446.AA07392@zohar> <8809121545.AA01198@cheetah.ucdavis.edu>
Sender: news@zippy.eecs.umich.edu
Reply-To: kfr@zippy.eecs.umich.edu (Karl F. Ruehr)
Organization: University of Michigan EECS Dept. Ann Arbor
Lines: 45
UUCP-Path: ihnp4!umich!zippy!kfr


  "The Lambda Calculus: its Syntax and Semantics", Henk Barendregt.
North-Holland (first edition, 1981; revised edition, 1984).  Approx.
$35.00 in paperback (look in a library first).

   This is the modern encyclopedic reference work on the lambda calculus
   and combinatory logic.  It is probably not of much use to anyone who
   isn't really committed to deep study: the first 70 pages (of 611
   total) are probably more than sufficient introduction for most needs,
   and it does not generally address computer science-related issues.  
   A wonder of modern typography.  Photographs of several famous
   theorists.  At least one fun exercise (6.8.14 on page 149.

  "Introduction to Combinators and Lambda Calculus", Roger Hindley and
Jonathan Seldin.  London Mathematical Society Student Texts #1,
Cambridge U. Press, 1986.  Price unknown, but probably < $35.00.

   This is a shorter, more relaxed introduction to the subject (not much
   model theory, for example, though see Chapter 12).  More suitable for
   curiosity-seekers, but still not exactly oriented toward the computer
   scientist specifically.  Produced from typewriter proofs.  Cute
   Appendix # 3.

  "The Calculi of Lambda Conversion", Alonzo Church.  Princeton
University Press, 1941.

   The original work (or very close to it) on lambda calculus (for
   combinatory logic, see Curry & Feys' "Combinatory Logic" or
   Schoenfinkel's work of 1924 (reprinted in "The Sourcebook for
   Mathematical Logic" (title?))).  Of mostly historical interest,
   though not to be dismissed.  Not much relevance to programming.


  The only books/works I can think of that would be helpful for
  functional language implementers, etc. would be:

  -- the Peyton-Jones book mentioned in the original article;
  -- perhaps a recent book by Glaser, Tinkin and Hill (the names are only
     approximate); I haven't read the book, but I recall that it has a chapter
     on lambda calculus.  "Functional Programming" probably in title.
  -- "Functional Programming" by Peter Henderson.  Prentice-Hall,
     "red-and-white binding series".  Perhaps the best bet besides
     Peyton-Jones.
  -- "Recursive Programming Techniques" by Burge (a bit out of date, but
     a real gold-mine of techniques, etc.