From: Tanaka Akira <akr@...17n.org>
Date: 2002-08-13T12:27:32+09:00
Subject: [ruby-dev:17988] Re: optimization module (Re: [ruby-list:35735] Re: tail recursion elimination)

In article <200208121403.g7CE3VWN022924@smtp16.dti.ne.jp>,
  Takaaki Tateishi <ttate@kt.jaist.ac.jp> writes:

> $B<B$O$3$N8!::$r$d$k$N$O$d$a$k$3$H$K$7$^$7$?!%(B
> $BB>$N>lLL$r9M$($k$HL5M}$C$]$$$N$G!D(B

$BL5M}$H$$$&$+(B... closure $B$KBP$9$k(B escape analysis $B$,I,MW$G$7$g$&$M!#(B

> $B$3$NJ}8~$r$^$5$K:#9M$($F$$$^$9!%(B

$B$^$!!"IaDL;W$$$D$/$+!#(B

> $B$I$A$i$r;H$&$+$O%f!<%6$KA*Br$5$;$k$D$b$j$G$$$^$9!%(B

$B$($'$H!"$I$A$i$H$$$&$H!"$U$?$D$"$k$H$$$&$3$H$G$9$+(B?
-- 
[$BEDCf(B $BE/(B][$B$?$J$+(B $B$"$-$i(B][Tanaka Akira]
$B!V$U$($m(B! $B$o$+$a$A$c$s:n@o$G$9$(C"=$B!W(B(Little Worker, $B7KM7@84](B)