$@4J7i$JJB9T8@8l(J L0: $@O@M}7?$H4X?t7?%W%m%0%i%_%s%0$r1[$($F(J $@J?ED7=Fs(J, $@86ED9/FA(J, $@;3:j7{0l(J

$@$"$i$^$7(J GHC, Oz $@$J$I$KBeI=$5$l$kJB9T8@8l$,;}$DMM!9$J5!G=$r8!F7(J, $@$h$j4J7i$JMWAG$+$i@.$kJB9T8@8l(J L0 $@$r@_7W$7$?(J. L0 $@$NFCD'$O(J, $@%b!<%IIU$-O@M}JQ?t(J, $\lambda$ $@9`$K$h$k=R8l$NCj>](J, $@G$0U$NJQ?t%9%3!<%T%s%0(J, $@@)8f$N$?$a$N@k8@E*$J7k9g;R$J$I$G$"$k(J. $@K\O@J8$G$O(J L0 $@$N9=J8$H A Simple Concurrent Language L0: Beyond Logic and Functional Programming Keiji Hirata, Yasunori Harada and Kenichi Yamazaki Abstract: By examining several notions possessed by conventional concurrent languages, such as GHC and Oz, we have designed a simple yet powerful concurrent language L0. The features of L0 are moded logic variable, predicate abstraction by$\lambda\$ term, arbitrary variable scoping, declarative connectives for control and so forth. This paper presents the syntax and operational semantics for L0, exhibits sample programs and discusses some issues regarding descriptive power and a set of primitives.