<html>
<body>
<pre>
********************************************************************
             klint - KL1 $B%W%m%0%i%`@EE*2r@O7O(B (Version 2.1)
                                                                    
                               $B>eED(B  $BOB5*(B
                       $BAa0pEDBg3XM}9)3XIt>pJs3X2J(B
                      ueda@ueda.info.waseda.ac.jp
                   Copyright (C) 1999  Kazunori Ueda

                              $B!](B $B$*$h$S(B $B!](B

            Kima  -- KL1 $B%W%m%0%i%`<+F0=$@57O(B (version 2.0)

                           $BLVBe0iBg(B, $B>eEDOB5*(B
                      $BAa0pEDBg3XBg3X1!M}9)3X8&5f2J(B
                       $BAa0pEDBg3XM}9)3XIt>pJs3X2J(B
                  {ajiro,ueda}@ueda.info.waseda.ac.jp
           Copyright (C) 1999  Yasuhiro Ajiro, Kazunori Ueda
********************************************************************

1. $B35MW(B

1.1  klint $BBh(B2.1$BHG(B

klint $BBh(B2.1$BHG$O!"(BKL1 $B%W%m%0%i%`$N$?$a$N@)Ls%Y!<%9$N@EE*2r@O7O$G$"$j!"0J(B
$B2<$N5!G=$r$b$C$F$$$^$9!#(B

  - $B%b!<%I2r@O(B
  - $B%G!<%?;2>H?t2r@O(B (linearity analysis)
  - $B7?2r@O(B

klint $BBh(B2.1$BHG$NCf?4E*$J5!G=$O%b!<%I2r@O$G!"J88%(B [1] $B$K=R$Y$F$"$kJ}K!$G(B
KL1$B%W%m%0%i%`$N%b!<%I$r2r@O$7$^$9!#%W%m%0%i%`$,!VNI$/%b!<%I$E$1$i$l$F$$(B
$B$k(B (well-moded)$B!W$H$O!"Bg$^$+$K8@$($P!"%W%m%0%i%`$NCf$G;H$C$F$$$kDL?.%W(B
$B%m%H%3%k$,6(D4E*$G$"$k$H$$$&$3$H$G$9!#(BKL1 $B%W%m%0%i%`$r(B well-moded $B$K=q$/(B
$B$3$H$K$h$C$F!"%W%m%0%i%`$N8m$j$r%b!<%I2r@O$K$h$C$F@EE*$K8!=P$G$-$k$h$&$K(B
$B$J$j$^$9(B [3]$B!#(B

klint $BBh(B2.1$BHG$O!"%W%m%0%i%`Cf$G07$&%G!<%?$N;2>H?t$H7?$N2r@O$b9T$J$$$^$9!#(B
$B%G!<%?;2>H?t2r@O$NL\E*$O!"0l$D$NJQ?t=P8=$+$i$7$+;2>H$5$l$J$$%G!<%?$H!"J#(B
$B?t$NJQ?t=P8=$+$i;2>H$5$l$k2DG=@-$N$"$k%G!<%?$H$r6hJL$9$k$3$H$G$9(B [6]$B!#$3(B
$B$N$h$&$K!";2>H?t2r@O$O%3%s%Q%$%k;~%4%_=8$a$N$?$a$N4pK\E*$J>pJs$rDs6!$7$F(B
$B$/$l$^$9!#(B

klint $BBh(B2.1$BHG$K$*$1$k7?2r@O$NL\E*$O!"$I$N$h$&$J4X?t5-9f$,%W%m%0%i%`$N3F(B
$B%Q%9(B ($B%4!<%k$N0z?t$H$7$F=P8=$7$&$k%G!<%?9=B$$NCf$N8D!9$N>l=j(B) $B$K=P8=$7$&(B
$B$k$+$rD4$Y$k$3$H$G$9!#(Bklint $BBh(B2.1$BHG$G$O!"4X?t5-9f$r#8$D$N%+%F%4%j$KJ,N`(B
$B$7$F2r@O$7$^$9!#(B

klint $BBh(B2.1$BHG$r;H$&$K$"$?$C$F!"%W%m%0%i%^$,%b!<%I$d;2>H?t$d7?$N@k8@$rM?(B
$B$($kI,MW$O$"$j$^$;$s!#$=$l$i$O(B klint $BBh(B2.1$BHG$,?dO@$7$F$/$l$^$9!#%b!<%I2r(B
$B@O$NF~LgE*$JJ88%$H$7$F$O(B[2]$B$,$"$j$^$9!#(B


1.2  kima $BBh(B2$BHG(B

Kima ver.2 $B$O!"%b!<%I2r@O$*$h$S7?2r@O$rMQ$$$F!"(BKL1 $B%W%m%0%i%`Cf$NJQ?t$N(B
$B>/?t8D$N=q$-8m$j$r<+F0E*$K=$@5$9$k$3$H$,$G$-$^$9(B [5]$B!#(BKL1 $B$J$I$N(B($BJB9T(B)$BO@(B
$BM}7?8@8l$G$O%W%m%0%i%`Cf$KJQ?t$rB?MQ$9$k$?$a!"4JC1$J8m$j$NB?$/$O$3$NJQ?t(B
$B$N;H$$J}$N4V0c$$$K$h$C$FH/@8$7$^$9!#(BKima ver.2 $B$O!"B?$/H/@8$9$k$3$N$h$&(B
$B$J8m$j$r@EE*$K=$@5$9$kG=NO$r$b$C$F$$$^$9!#C1$J$k>e5-$N$h$&$J8m$j$G$J$$>l(B
$B9g$G$b!"(BKima ver.2 $B$O8m$j$N860x$H$J$C$F$$$k5-9f$N8uJd$r>/?t8D$K9J$j9~$s(B
$B$GDh<($7$^$9(B [4]$B!#(B


2. $B%$%s%9%H!<%k$*$h$S%U%!%$%k9=@.(B

klint $BBh(B2.1$BHG$*$h$S(B kima $BBh(B2$BHG$O(B KL1 $B8@8l$@$1$G=q$+$l$F$$$F!"(BKLIC $B=hM}7O(B
$B$NF0$/(BUNIX$B4D6-$GMxMQ$9$k$3$H$,$G$-$^$9!#(B

klint $BBh(B2.1$BHG$NG[I[%-%C%H$O!"2<5-$N%U%!%$%k$+$i$J$C$F$$$^$9!#(B

  (1) Makefile -- make $B%U%!%$%k(B
  (2) Readme-J -- $B$3$N%U%!%$%k(B
      Readme-E -- $B$3$N%U%!%$%k$N1Q8lHG(B
  (3) klint-main4.kl1, read_program4.kl1, normalize5.kl1, unify.kl1
      builtin_DB6.kl1, numberbuiltin3.kl1, findpath4.kl1
      constraintsB.kl1, type.kl1, stdinout.kl1 commandline.kl1
      klint25.kl1, graphF.kl1, tgraph3.kl1, decode2.kl1, tdecode.kl1
      reduce6.kl1, sort.kl1, outgraph.kl1, outdecl.kl1, tc.kl1,
      outconstraints.kl1
	       -- klint $BBh(B2.1$BHG$N%=!<%9%W%m%0%i%`(B
  (4) examples/merge.kl1, examples/hamm.kl1
               -- $B$3$N%^%K%e%"%k$GMQ$$$?NcBj%W%m%0%i%`(B
  (5) kima-v2/ -- kima $BBh(B2$BHG$N%G%#%l%/%H%j!J>\:Y$K$D$$$F$O%G%#%l%/%H(B
                  $B%j$N2<$N(B Readme-j, INSTALL-j $B$r$*FI$_2<$5$$!K(B

$B;29MJ88%(B

[1] Ueda, K. and Morita, M., Moded Flat GHC and Its Message-Oriented
Implementation Technique.  New Generation Computing, Vol.13, No.1
(1994), pp.3-43.

[2] Ueda, K., I/O Mode Analysis in Concurrent Logic Programming.  In
Theory and Practice of Parallel Programming, LNCS 907, Springer, 1995,
pp.356-368.

[3] Ueda, K., Experiences with Strong Moding in Concurrent
Logic/Constraint Programming.  In Proc. Int. Workshop on Parallel
Symbolic Languages and Systems (PSLS'95), T. Ito, R.H. Halstead, Jr., and
C. Queinnec (eds.), LNCS 1068, Springer, 1996, pp.134-153.

[4] Cho, K. and Ueda, K., Diagnosing Non-Well-Moded Concurrent Logic
Programs.  To be presented at 1996 Joint International Conference and
Symposium on Logic Programming (JICSLP'96), Bonn, Germany, September
1996.

[5] Ajiro, Y., Ueda, K. and Cho, K., Error-correcting Source Code.  In
Proc. Fourth Int. Conf. on Principles and Practice of Constraint
Programming (CP'98), LNCS 1520, Springer-Verlag, Berlin, 1998, pp.40-54.

[6] $B>eEDOB5*!'JB9TO@M}%W%m%0%i%`$N;2>H?t2r@O!%>pJs=hM}3X2q%W%m%0%i%_%s%0(B
$B8&5f2q!$(B1998$BG/(B8$B7n!%2~D{HG$r!V(BKL1$B%W%m%0%i%`@EE*2r@O7O!W@.2LJs9p=q!$F|K\>p(B
$BJs=hM}3+H/6(2q!$(B1999 $B$K=j<}!%(B
</pre>
</html>
</body>
