🚀 go-pugleaf

In article <1992Dec30.094352.4243@cucs5.cs.cuhk.hk> bmtong@cs.cuhk.hk (Tong Bo-Ming) writes:
>In the field of Logic Programming, we have a kind of optimization
>technique called the Last Call Optimization.  The idea is simple.

 The proper term - even in the field of logic programming is
 "tail recursion elimination". Yes, its supported in all versions
 of SPARcompilers 1.X and above (I think -O3 or -O4 will get you).

 Most compilers do support this - very easily seen the benefits of this
 in compiling li - one of the SPEC benchmark integer benchmarks.

 Many times inlining routines would expose more oppurtunities for
 tail recursion elimination as well and some compilers do exploit that
 as well.

>	p(a,b,c)
>	{	x(a);
>		y(b);
>		z(c);
>	}
--
--------------------------------
   Renukanthan Raman				Internet:renu.raman@Eng.Sun.COM
   M/S 16-11, 2500 Garcia Avenue,               Tel :415-336-1813
   Sun Microsystems, Mt. View,  CA 94043