Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!uunet!mcsun!ukc!edcastle!aiai!jeff
From: jeff@aiai.ed.ac.uk (Jeff Dalton)
Newsgroups: comp.lang.prolog
Subject: Re: Backtracking for Happiness
Keywords: backtrack
Message-ID: <2575@skye.ed.ac.uk>
Date: 25 May 90 18:07:42 GMT
References: <14557@dime.cs.umass.edu> <3044@goanna.cs.rmit.oz.au>
Reply-To: jeff@aiai.UUCP (Jeff Dalton)
Organization: AIAI, University of Edinburgh, Scotland
Lines: 16

In article <3044@goanna.cs.rmit.oz.au> ok@goanna.cs.rmit.oz.au (Richard A. O'Keefe) writes:
 >(b) You did realise that the preceding three rules are _Prolog_, didn't you?
 >    There's this little package that plugs into term_expansion/2.  (Well,
 >    two little packages:  I have one, Lee Naish has another better one.)

Yes, but the little packages probably don't cover all of ML.

 >(c) It might be clearer to express it as
 >	length(L) = scan_list(plus, map_list(k(1), L), 0).
 >    and have the definition in (a) generated automatically.
 >    (I assume that k(_, K) = K is already defined.)
 >
 >    Oh, which language do you think that definition's written in?

Oh, I don't know.  If we're allowed to use "little packages" maybe
it's Pascal.