I don't understand how you concluded that the reordering algorithm
won't do anything.

In any case, I am ambivalent about the approach taken.

On Mon, Sep 21, 2009 at 2:37 PM, Taylor R Campbell <[email protected]> wrote:
> Any preference now about which transformation to commit, between the
> conservative and aggressive options?
>
> Closer inspection of LIAR's subproblem ordering suggests that in
> programs that the transformations are applicable to, LIAR wouldn't do
> anything interesting anyway, since it wouldn't recognize the programs
> as cases in which it can find any better ordering of subproblems than
> a random one (i.e. right-to-left).  So I'm inclined to commit the more
> aggressive one, partially just because it's a little easier to
> understand the code, to which I can add the more detailed comment.
>


_______________________________________________
MIT-Scheme-devel mailing list
[email protected]
http://lists.gnu.org/mailman/listinfo/mit-scheme-devel

Reply via email to