🚀 go-pugleaf

NTT$B4pAC8&5f=j$N;3:j$G$9(B. 

The article <SCHUKO.92Sep7153847@ebisu.cc.kyushu-u.ac.jp>, 
$B:4F#<~9T(B@$BBg7?7W;;5!%;%s%?!<(B.$B6eBg$5$s$X$NJV;v$G$9(B. 

continuation ($B$NFC$K<BAu(B) $B$K$D$$$F$O(B, $BA4A3@lLg$G$O$J$$$N$G$9$,(B, 
$B:4F#$5$s$N$*$C$7$c$kO@J8(B[2]$B$H(B[3]$B$r$6$C$HFI$s$G$_$^$7$?(B. [1]$B$O6a$/$K(B
$B;}$C$F$$$k?M$,$$$?$N$G$9$,(B, $B8|$$$N$G$^$@FI$s$G$$$^$;$s(B. 

$BJ88%(B:
[1] Andrew W. Appel, "Compiling with Continuations",
    Cambridge University Press. 1992

[2] Andrew W. Appel, "Garbage collection can be faster than stack allocation,"
    IPL vol.25, 1987, 275--279.

[3] R. Hieb, R. K. Dybvig, C. Bruggeman,
    "Representing Control in the Presence of First-Class Continuation,"
    Proc. SIGPLAN '90 Conference on Programming Language Design and Implementation,
    1990, 66--77.

[2]$B$NJ88%$O(B, $B0-$/2r<a$9$l$P(B, $B%a%b%j$,Bg$-$/$J$l$PJ?6QE*$J(BGC$B$N;~4V$O8:$k$h(B
$B$H$$$&$@$1$NOC$G$9(B. $B$=$l$K(B, $B8+@Q$b$j$,$A$g$C$H4E$$$H;W$$$^$9(B. $B%a%b%j2rJ|$N(B
$B$3$H$K$D$$$F5DO@$7$F$$$^$9$,(B, $B%a%b%j3MF@$NJ}$OA4A35DO@$7$F$$$J$$(B. 1$B%U%l!<(B
$B%`$NBg$-$5$H$$$&$N$O(Bvariable$B$J$o$1$G$9(B. variable size$B$N%a%b%j3MF@$H$$$&$N(B
$B$O(Bnegligible$B$G$O$J$$(B. $B%9%?%C%/$J$i%9%?%C%/%H%C%W%l%8%9%?$N8:;;$@$1$G$9(B. 

$B$3$N%"%W%m!<%A$O(BSymbolics$B$G(B, $BLkJV$k;~$K(BGC$B$r5/F0$7$F$*$1$P(B, $B<!$NF|(B1$BF|(BGC$B$J$7(B
$B$G2a$4$;$k$H$$$&$N$K;w$?$H$3$m$,$"$j$^$9(B. $B$"$l$O$"$l$G;d$O$H$F$b9%$-$J$N$G(B
$B$9$,(B, $B$@$+$i$H$$$C$F(B, $B$A$c$s$H$d$l$P%9%?%C%/%a%+%K%:%`$G2s<}$G$-$k%a%b%j$^(B
$B$G(BGC$B$KG$$;$?$/$O$J$$$G$9(B. ($B2f!9$,:n$C$F$$$k(BTAO$B$O(B, GC$B$^$+$;$N$H$3$m$,$"$k$N(B
$B$G(B, $B?M$N$3$H$O8@$($J$$$N$G$9$1$I(B. )

>$B$3$l$K$O%R!<%W>e$K%l%3!<%I$r<h$C$F$$$/$H!"(B frame linkage cost, GC overhead,
>decreased locality of reference $B$J$I$NLdBj$,82:_2=$7!"FC$K(B 3$BHVL\$O(B
>$BBgMFNL$N%-%c%C%7%e$r;}$D(BRISC $B%7%9%F%`>e$G$O$^$:$$!#(B
$B$H$$$&J88%(B[3]$B$N;XE&$O$b$C$H$b$G$9(B. $B4pK\E*$KF1$8$3$H$r$7$?$i(B, [3]$B$NJ}$,(B
$BB.$$$H;W$$$^$9(B. $B$=$l$K(Bcontinuation$B$r;H$o$J$1$l$P(B, $BIaDL$N(BLisp$B$HF1$8$KF0(B
$B$/$H$$$&E@$,NI$$(B. $B$3$l$@$1$G$b(B[3]$B$NJ}$,M%$l$F$$$k$H;W$$$^$9(B. 

$B$?$@(B, $B%$%s%W%j%a%s%H$N4JC1$5Ey$+$i(B, continuation$B$r;}$D?7$7$$8@8l$r%Q%C$H(B
$B:n$j$?$$$H$+$$$&;~$K$O(B, [2]$B$bB?$$$K;29M$K$J$k$H;W$$$^$9(B. $B$"$k$$$O(B, 
Concurrent Scheme $B$J$s$F$$$&$b$N$,$"$l$P(B, [2]$BE*$J<BAu$K$J$k$+$b$7$l$J$$(B. 

>if (1st class cont. $B$N<BAu$,=E$$(B) cont. $B$r30$9$N$O@52r(B;
>else $BIT@52r(B;
$B$3$l$O(Bcontinuation$B$N<BAu$NHf3S$H$OJL$NOC$G(B, continuation$B$,$"$k;~$H$J$$;~$N(B
$BHf3S$J$o$1$G$9$M(B. $BO@J8$r(B2$B$DFI$s$@$@$1$@$H(B, $B$d$C$Q$j(Bcontinuation$B$C$F(B, catch
$B$d(Bexit$B$KHf$Y$F$+$J$j=E$$$J$H$$$&0u>]$G$9(B. $BK\<AE*$K%3%T!<$J$o$1$G$9(B. 

$B$H$$$&$o$1$G(B, $B;d$O(B

if (1st class cont$B$,B>$N<BAu$K0-1F6A$rM?$($J$$(B) cont. $B$,$"$C$F$b$h$$(B;
else $B$$$i$J$$(B;

$B$H$$$&N)>l$G$9(B. 

NTT$B4pAC8&5f=j(B $B;3:j(B (yamazaki@nuesun.ntt.jp)