From bparsia@email.unc.edu Tue Aug 28 14:47:59 2001
Received: from smtpsrv1.isis.unc.edu (smtpsrv1.isis.unc.edu [152.2.1.138])
	by swi.psy.uva.nl (8.11.2/8.11.2) with ESMTP id f7SClwb04646
	for <prolog@swi.psy.uva.nl>; Tue, 28 Aug 2001 14:47:58 +0200 (MET DST)
Received: from JANEG-PC2 (janeg-pc2.ils.unc.edu [152.2.81.69])
	by smtpsrv1.isis.unc.edu (8.9.3/8.9.1) with ESMTP id IAA12841
	for <prolog@swi.psy.uva.nl>; Tue, 28 Aug 2001 08:47:52 -0400 (EDT)
Date: Tue, 28 Aug 2001 08:52:24 -0400
From: Bijan Parsia <bparsia@email.unc.edu>
To: prolog@swi.psy.uva.nl
Subject: Re:  [SWIPL] prolog syntax
Message-ID: <2556332310.998988744@JANEG-PC2>
In-Reply-To: <200108280017.MAA161699@atlas.otago.ac.nz>
X-Mailer: Mulberry/2.0.5 (Win32)
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii; format=flowed
Content-Transfer-Encoding: 7bit
Content-Disposition: inline

--On Tuesday, August 28, 2001 12:17 PM +1200 "Richard A. O'Keefe" 
<ok@atlas.otago.ac.nz> wrote:

[snip]
> Writing Prolog list-processing predicates is pretty obvious if you know
> how to write list-processing functions in Lisp, so "The Simple Schemer"

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.

> might be a good start too.
[snip]

I second that endorsement. A "Little Prologer" would be fairly easy to 
generate from "The Little Schemer", even counting the need to add Prolog 
specific bits (and kill stuff like the binding forms).

If you want a more "straightforward" presentation, try Simply Scheme...I'm 
fairly sure it has a chapter or two on list processing :)

Cheers,
Bijan Parsia.

