Greetings! More on the logic behind this tomorrow, but I've just checked in a first stab at mutual recursion autoproclamation. Try it out on the code below, takr.cl, and the few functions from pcl that are thus converted.
Take care, Robert Boyer <[EMAIL PROTECTED]> writes: > I'm puzzled that your wonderful new proclaiming compiler does not see that > these two functions each return exactly one value. Why isn't it the case > that when r-wl is compiled, it is recognized that (a) r needs recompiling > and that (b) consequently r-wl needs recompiling, and that consequently > some sort of mutual recursion analysis is called for. > > (defun r (term) > (cond ((atom term) term) > (t (r-wl 1 2)))) > > (defun r-wl (term lst) > (cond ((null lst) term) > (lst (r 3)) > (t (r-wl term 4)))) > > Thanks! > > Bob > > -- Camm Maguire [EMAIL PROTECTED] ========================================================================== "The earth is but one country, and mankind its citizens." -- Baha'u'llah _______________________________________________ Gcl-devel mailing list Gcl-devel@gnu.org http://lists.gnu.org/mailman/listinfo/gcl-devel
