Parallel unification and meta-interpreters in GHC:
Abstract: "This paper presents a new unification program in GHC. The program is designed for obtaining the maximal efficiency by making the best of parallelism inherent in the unification problem. It employs stream parallelism together with a useful programming technique called short circuit fo...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1989
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
468 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents a new unification program in GHC. The program is designed for obtaining the maximal efficiency by making the best of parallelism inherent in the unification problem. It employs stream parallelism together with a useful programming technique called short circuit for detecting stable properties of networks. Efficient meta-interpreters in which an object variable is represented by a ground term are developed by incorporating this unification program. Superiority of the parallel unificationprogram over more sequential ones becomes more evident as it is used in larger applications." |
| Beschreibung: | 20 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010947427 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960912s1989 |||| 00||| engod | ||
| 035 | |a (OCoLC)22471136 | ||
| 035 | |a (DE-599)BVBBV010947427 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Fujita, Hiroshi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Parallel unification and meta-interpreters in GHC |
| 264 | 1 | |a Tokyo, Japan |c 1989 | |
| 300 | |a 20 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 468 | |
| 520 | 3 | |a Abstract: "This paper presents a new unification program in GHC. The program is designed for obtaining the maximal efficiency by making the best of parallelism inherent in the unification problem. It employs stream parallelism together with a useful programming technique called short circuit for detecting stable properties of networks. Efficient meta-interpreters in which an object variable is represented by a ground term are developed by incorporating this unification program. Superiority of the parallel unificationprogram over more sequential ones becomes more evident as it is used in larger applications." | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Parallel programming (Computer science) | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 468 |w (DE-604)BV010923438 |9 468 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007321622 | ||
Datensatz im Suchindex
| _version_ | 1804125434094288896 |
|---|---|
| any_adam_object | |
| author | Fujita, Hiroshi |
| author_facet | Fujita, Hiroshi |
| author_role | aut |
| author_sort | Fujita, Hiroshi |
| author_variant | h f hf |
| building | Verbundindex |
| bvnumber | BV010947427 |
| ctrlnum | (OCoLC)22471136 (DE-599)BVBBV010947427 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01574nam a2200301 cb4500</leader><controlfield tag="001">BV010947427</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960912s1989 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22471136</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010947427</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rakddb</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-91G</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Fujita, Hiroshi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Parallel unification and meta-interpreters in GHC</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">20 S.</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="1" ind2=" "><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">468</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a new unification program in GHC. The program is designed for obtaining the maximal efficiency by making the best of parallelism inherent in the unification problem. It employs stream parallelism together with a useful programming technique called short circuit for detecting stable properties of networks. Efficient meta-interpreters in which an object variable is represented by a ground term are developed by incorporating this unification program. Superiority of the parallel unificationprogram over more sequential ones becomes more evident as it is used in larger applications."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel programming (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report</subfield><subfield code="v">468</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">468</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007321622</subfield></datafield></record></collection> |
| id | DE-604.BV010947427 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:30Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007321622 |
| oclc_num | 22471136 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 20 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| series2 | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |
| spelling | Fujita, Hiroshi Verfasser aut Parallel unification and meta-interpreters in GHC Tokyo, Japan 1989 20 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 468 Abstract: "This paper presents a new unification program in GHC. The program is designed for obtaining the maximal efficiency by making the best of parallelism inherent in the unification problem. It employs stream parallelism together with a useful programming technique called short circuit for detecting stable properties of networks. Efficient meta-interpreters in which an object variable is represented by a ground term are developed by incorporating this unification program. Superiority of the parallel unificationprogram over more sequential ones becomes more evident as it is used in larger applications." Logic programming Parallel programming (Computer science) Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 468 (DE-604)BV010923438 468 |
| spellingShingle | Fujita, Hiroshi Parallel unification and meta-interpreters in GHC Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report Logic programming Parallel programming (Computer science) |
| title | Parallel unification and meta-interpreters in GHC |
| title_auth | Parallel unification and meta-interpreters in GHC |
| title_exact_search | Parallel unification and meta-interpreters in GHC |
| title_full | Parallel unification and meta-interpreters in GHC |
| title_fullStr | Parallel unification and meta-interpreters in GHC |
| title_full_unstemmed | Parallel unification and meta-interpreters in GHC |
| title_short | Parallel unification and meta-interpreters in GHC |
| title_sort | parallel unification and meta interpreters in ghc |
| topic | Logic programming Parallel programming (Computer science) |
| topic_facet | Logic programming Parallel programming (Computer science) |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT fujitahiroshi parallelunificationandmetainterpretersinghc |