From ok@atlas.otago.ac.nz Wed Aug 29 04:55:09 2001
Received: from atlas.otago.ac.nz (atlas.otago.ac.nz [139.80.32.250])
	by swi.psy.uva.nl (8.11.2/8.11.2) with ESMTP id f7T2t8b23531
	for <prolog@swi.psy.uva.nl>; Wed, 29 Aug 2001 04:55:08 +0200 (MET DST)
Received: (from ok@localhost)
	by atlas.otago.ac.nz (8.9.3/8.9.3) id OAA180979;
	Wed, 29 Aug 2001 14:54:58 +1200 (NZST)
Date: Wed, 29 Aug 2001 14:54:58 +1200 (NZST)
From: "Richard A. O'Keefe" <ok@atlas.otago.ac.nz>
Message-Id: <200108290254.OAA180979@atlas.otago.ac.nz>
To: bparsia@email.unc.edu, prolog@swi.psy.uva.nl
Subject: Re:  [SWIPL] prolog syntax

I wrote:
	> Writing Prolog list-processing predicates is pretty obvious if you know
	> how to write list-processing functions in Lisp, so "The Simple Schemer"
	
Bijan Parsia corrected me:
	It's "The Little Schemer"; sequel: "The Seasoned Schemer" which might not 
	be as useful as it spends a fair bit of time on continuations, IIRC.
	
ARGH.  That's what happens when I don't actually bother to *check* my
bookshelf.

	The Little Scheme, fourth edition
	Daniel P. Friedman & Matthias Felleisen
	The MIT Press, 1996
	ISBN 0-262-56099-2

I don't actually _like_ the style of the book very much; the rather sad
attempts at humour may go down well in the USA, but terminal cuteness is
not my cup of fur.  That doesn't blind me to the fact that it is a *great*
introduction to the art of recursive programming in general and list
processing in particular.

