Path: utzoo!attcan!uunet!seismo!sundc!pitstop!sun!quintus!ok
From: ok@quintus.uucp (Richard A. O'Keefe)
Newsgroups: comp.lang.prolog
Subject: Re: In defence of difference-lists.
Keywords: Difference-lists, Dataflow analysis, Program transformation.
Message-ID: <550@quintus.UUCP>
Date: 19 Oct 88 04:33:27 GMT
References: <3002@mulga.oz> <542@quintus.UUCP> <3005@mulga.oz> <2502@munnari.oz>
Sender: news@quintus.UUCP
Reply-To: ok@quintus.UUCP (Richard A. O'Keefe)
Organization: Quintus Computer Systems, Inc.
Lines: 12

In article <2502@munnari.oz> lee@munmurra.UUCP (Lee Naish) writes:
>Also if anyone would like
>to verify my claim that the d-list "fold" style transformation can be
>automated, I would encourage it (are you listening Richard? :-).

I am listening.  I am interested.  But I am also _busy_.

Just one point about the "unfold" approach:  the Eureka steps aren't
really all that hard to find.  Basically, you are looking for a clump
of goals which look as though they can be unfolded together, and you
usually have to generalise the clump a little bit to stop the unfold
steps getting in each other's way.