<?xml version="1.0" encoding="UTF-8"?>
<collection xmlns="http://www.loc.gov/MARC21/slim">
 <record>
  <leader>     caa a22        4500</leader>
  <controlfield tag="001">467988706</controlfield>
  <controlfield tag="003">CHVBK</controlfield>
  <controlfield tag="005">20180323112539.0</controlfield>
  <controlfield tag="007">cr unu---uuuuu</controlfield>
  <controlfield tag="008">170328e19900201xx      s     000 0 eng  </controlfield>
  <datafield tag="024" ind1="7" ind2="0">
   <subfield code="a">10.1007/BF03037204</subfield>
   <subfield code="2">doi</subfield>
  </datafield>
  <datafield tag="035" ind1=" " ind2=" ">
   <subfield code="a">(NATIONALLICENCE)springer-10.1007/BF03037204</subfield>
  </datafield>
  <datafield tag="245" ind1="0" ind2="2">
   <subfield code="a">A new external reference management and distributed unification for KL1</subfield>
   <subfield code="h">[Elektronische Daten]</subfield>
   <subfield code="c">[Nobuyuki Ichiyoshi, Kazuaki Rokusawa, Katsuto Nakajima, Yu Inamura]</subfield>
  </datafield>
  <datafield tag="520" ind1="3" ind2=" ">
   <subfield code="a">This paper describes a new external reference management scheme for KL1, a committed choice logic programming language based on GHC. The significance of the new scheme is that it realizes incremental inter-processor garbage collection. Previous distributed implementations of committed choice languages had not seriously addressed inter-processor garbage collection. Incremental inter-precessor garbage collection is realized by the Weighted Export Counting (WEC). It is a first attempt to use the weighted reference counting technique in logic programming language implementation, and is also new in that it has introduced export and import tables for making independent local garbage collection possible and reducing the number of inter-processor read requests. The problems with exhaustion of reference counts and indirect exportation are discussed. Since the binding order rule adopted in our previous implementation for avoiding creation of reference loops is insufficient in the presence of indirect exportation, a new binding order rule is introduced. We prove that avoidance of reference loops is guaranteed and also prove that the unification procedure always terminates for non-circular structures.</subfield>
  </datafield>
  <datafield tag="540" ind1=" " ind2=" ">
   <subfield code="a">Ohmsha, Ltd. and Springer, 1990</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Loosely-coupled Multiprocessor</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Concurrent Logic Language</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Implementation</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Inter-processor Garbage Collection</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Weighted Export Counting</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="690" ind1=" " ind2="7">
   <subfield code="a">Distributed Unification</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Ichiyoshi</subfield>
   <subfield code="D">Nobuyuki</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Rokusawa</subfield>
   <subfield code="D">Kazuaki</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Nakajima</subfield>
   <subfield code="D">Katsuto</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="700" ind1="1" ind2=" ">
   <subfield code="a">Inamura</subfield>
   <subfield code="D">Yu</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="773" ind1="0" ind2=" ">
   <subfield code="t">New Generation Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/2-3(1990-02-01), 159-177</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">7:2-3&lt;159</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">354</subfield>
  </datafield>
  <datafield tag="856" ind1="4" ind2="0">
   <subfield code="u">https://doi.org/10.1007/BF03037204</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="908" ind1=" " ind2=" ">
   <subfield code="D">1</subfield>
   <subfield code="a">research-article</subfield>
   <subfield code="2">jats</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">856</subfield>
   <subfield code="E">40</subfield>
   <subfield code="u">https://doi.org/10.1007/BF03037204</subfield>
   <subfield code="q">text/html</subfield>
   <subfield code="z">Onlinezugriff via DOI</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Ichiyoshi</subfield>
   <subfield code="D">Nobuyuki</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Rokusawa</subfield>
   <subfield code="D">Kazuaki</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Nakajima</subfield>
   <subfield code="D">Katsuto</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">700</subfield>
   <subfield code="E">1-</subfield>
   <subfield code="a">Inamura</subfield>
   <subfield code="D">Yu</subfield>
   <subfield code="u">Institute for New Generation Computer Technology, 4-28, Mita 1-chome, Minato-ku, 108, Tokyo, Japan</subfield>
   <subfield code="4">aut</subfield>
  </datafield>
  <datafield tag="950" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="P">773</subfield>
   <subfield code="E">0-</subfield>
   <subfield code="t">New Generation Computing</subfield>
   <subfield code="d">Springer-Verlag</subfield>
   <subfield code="g">7/2-3(1990-02-01), 159-177</subfield>
   <subfield code="x">0288-3635</subfield>
   <subfield code="q">7:2-3&lt;159</subfield>
   <subfield code="1">1990</subfield>
   <subfield code="2">7</subfield>
   <subfield code="o">354</subfield>
  </datafield>
  <datafield tag="900" ind1=" " ind2="7">
   <subfield code="a">Metadata rights reserved</subfield>
   <subfield code="b">Springer special CC-BY-NC licence</subfield>
   <subfield code="2">nationallicence</subfield>
  </datafield>
  <datafield tag="898" ind1=" " ind2=" ">
   <subfield code="a">BK010053</subfield>
   <subfield code="b">XK010053</subfield>
   <subfield code="c">XK010000</subfield>
  </datafield>
  <datafield tag="949" ind1=" " ind2=" ">
   <subfield code="B">NATIONALLICENCE</subfield>
   <subfield code="F">NATIONALLICENCE</subfield>
   <subfield code="b">NL-springer</subfield>
  </datafield>
 </record>
</collection>
