Path: utzoo!mnetor!uunet!lll-winken!lll-lcc!ames!amdahl!pacbell!att-ih!alberta!ubc-cs!grads.cs.ubc.ca!bross
From: bross@grads.cs.ubc.ca (Brian Ross)
Newsgroups: comp.lang.prolog
Subject: Re: Partial evaluation, unfolding
Message-ID: <1905@ubc-cs.UUCP>
Date: 25 Mar 88 19:50:59 GMT
References: <503@ashton.UUCP>
Sender: nobody@ubc-cs.UUCP
Reply-To: bross@grads.cs.ubc.ca (Brian Ross)
Organization: UBC Department of Computer Science, Vancouver, B.C., Canada
Lines: 13
Keywords: partial evaluation, unfolding, partial execution

In article <503@ashton.UUCP> dwiggins@atsun.UUCP (Don Dwiggins) writes:
>Several recent messages have made incidental reference to this subject under
>various names.  I'd like to know if there's a good overview or introductory
>level discussion of the topic (particularly in the Prolog context).  It seems
>that, along with difference lists and various other tricks, a working knowledge
>of unfolding (how to do it, when it's worth it, what are the pitfalls, etc.)
>would be a valuable addition to the Prolog programmer's armamentarium.

E. Shapiro's _Art of Prolog_ has an excellent chapter on meta-interpretation
of Prolog programs, and is a good introduction on "how to do it"
(especially in an expert system shell context).

Brian J. Ross
bross@grads.cs.ubc.cdn