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

In article <200208130728.g7D7SPr27632@sharui.nakada.kanuma.tochigi.jp>,
  nobu.nakada@nifty.ne.jp writes:

> $B%$%F%l!<%?$KEO$5$l$?%V%m%C%/$,$I$3$K$bJ]B8$5$l$F$$$J$$$H$$$&J](B
> $B>Z$O$J$$$N$G!"L5M}$8$c$J$$$+$H;W$$$^$9!#(B

$B$O$$!#%$%F%l!<%?$NCf?H$r2r@O$7$J$$8B$j$O!#(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)