[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
[Gcl-devel] mutual recursion autoproclamation
From: |
Camm Maguire |
Subject: |
[Gcl-devel] mutual recursion autoproclamation |
Date: |
18 Jul 2006 00:54:59 -0400 |
User-agent: |
Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 |
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 <address@hidden> 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 address@hidden
==========================================================================
"The earth is but one country, and mankind its citizens." -- Baha'u'llah
[Prev in Thread] |
Current Thread |
[Next in Thread] |
- [Gcl-devel] mutual recursion autoproclamation,
Camm Maguire <=