Path: utzoo!attcan!utgpu!jarvis.csri.toronto.edu!mailrus!tut.cis.ohio-state.edu!rutgers!sun-barr!texsun!pitstop!sundc!seismo!uunet!mcvax!ukc!icdoc!cdsm
From: cdsm@doc.ic.ac.uk (Chris Moss)
Newsgroups: comp.lang.prolog
Subject: Re: Higher Order Extensions
Keywords: Constructive "all solutions" in pure Prolog
Message-ID: <801@gould.doc.ic.ac.uk>
Date: 10 May 89 13:15:17 GMT
References: <11500013@hpldola.HP.COM> <783@gould.doc.ic.ac.uk> <1019@mannix.iros1.UUCP>
Reply-To: cdsm@doc.ic.ac.uk (Chris Moss)
Organization: Dept. of Computing, Imperial College, London, UK.
Lines: 10

In article <1019@mannix.iros1.UUCP> tarau@iros1.UUCP (Paul Tarau) writes:
>
>Defining a findall-like predicate in pure Prolog is relatively easy,
>if we use a data-structure representation of the database.

Quite. What you've done is to take everything "up" a level.
What you haven't shown is the implementation of "findall" AS IT EXISTS,
applying to normal Prolog.

Chris Moss