Re: Thinking Recursion
From: student (nospam_at_a.b.c.dINVALID)
Date: 03/29/05
- Next message: Torkel Franzen: "Re: Thinking Recursion"
- Previous message: Chema: "Re: CLP(FD) Prolog: help needed with a simple problem"
- In reply to: Torkel Franzen: "Re: Thinking Recursion"
- Next in thread: Torkel Franzen: "Re: Thinking Recursion"
- Reply: Torkel Franzen: "Re: Thinking Recursion"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Tue, 29 Mar 2005 10:02:03 GMT
Torkel Franzen wrote:
> student <nospam@a.b.c.dINVALID> writes:
>
>
>>Can every (cut-free, etc) Prolog predicate definition be expressed as
>>equations?
>
>
> Indeed not, which as we know is one of the glories of Prolog!
Thank you.
> But you asked about append/3. ....
Actually, what I asked was "how are things like 'append/3' derived?"
and I think it is clear from the ensuing context that this was a
rhetorical flourish,
a bit of fanfare to get things rolling.
My question was (and is) implicit in my suggestion that it would be
nice if LPTP
allowed users to directly input predicate definitions in internal form,
instead of only being able
to see the internal forms of predicate definitions that arise when a
Prolog predicate
is translated into internal form by LPTP.
--
- Next message: Torkel Franzen: "Re: Thinking Recursion"
- Previous message: Chema: "Re: CLP(FD) Prolog: help needed with a simple problem"
- In reply to: Torkel Franzen: "Re: Thinking Recursion"
- Next in thread: Torkel Franzen: "Re: Thinking Recursion"
- Reply: Torkel Franzen: "Re: Thinking Recursion"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]