A fixpoint semantics of Guarded Horn Clauses:
Abstract: "This paper presents a fixpoint semantics of flat GHC programs. The framework is parallel to the fixpoint semantics of Prolog programs. First, instead of an atom and a Herbrand interpretation, an atom behavior and a behavior interpretation are considered, where an atom behavior is a f...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Tokyo, Japan
1990
|
| Schriftenreihe: | Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report
551 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "This paper presents a fixpoint semantics of flat GHC programs. The framework is parallel to the fixpoint semantics of Prolog programs. First, instead of an atom and a Herbrand interpretation, an atom behavior and a behavior interpretation are considered, where an atom behavior is a finite set of atom pairs (A[sigma], A[tau]), and a behavior interpretation is a set of atom behaviors. Next, instead of the conjunction and the implication for atoms, the parallel conjunction and the guarded implication for atom behaviors are introduced. A transformation T for behavior interpretations associated with a GHC program is defined using those two notions Then, the semantics of a GHC program is defined as the least fixpoint of the transformation T. The relations to an operational semantics of GHC programs and to the semantics of Prolog programs are discussed as well. |
| Beschreibung: | 21 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010949202 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 960913s1990 |||| 00||| engod | ||
| 035 | |a (OCoLC)24838889 | ||
| 035 | |a (DE-599)BVBBV010949202 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-91G | ||
| 100 | 1 | |a Kanamori, Tadashi |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a A fixpoint semantics of Guarded Horn Clauses |c by T. Kanamori & M. Ueno |
| 264 | 1 | |a Tokyo, Japan |c 1990 | |
| 300 | |a 21 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 551 | |
| 520 | 3 | |a Abstract: "This paper presents a fixpoint semantics of flat GHC programs. The framework is parallel to the fixpoint semantics of Prolog programs. First, instead of an atom and a Herbrand interpretation, an atom behavior and a behavior interpretation are considered, where an atom behavior is a finite set of atom pairs (A[sigma], A[tau]), and a behavior interpretation is a set of atom behaviors. Next, instead of the conjunction and the implication for atoms, the parallel conjunction and the guarded implication for atom behaviors are introduced. A transformation T for behavior interpretations associated with a GHC program is defined using those two notions | |
| 520 | 3 | |a Then, the semantics of a GHC program is defined as the least fixpoint of the transformation T. The relations to an operational semantics of GHC programs and to the semantics of Prolog programs are discussed as well. | |
| 650 | 4 | |a GHC (Computer program language) | |
| 650 | 4 | |a Horn clauses | |
| 700 | 1 | |a Ueno, Machi |e Verfasser |4 aut | |
| 830 | 0 | |a Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report |v 551 |w (DE-604)BV010923438 |9 551 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007323135 | ||
Datensatz im Suchindex
| _version_ | 1804125436142157824 |
|---|---|
| any_adam_object | |
| author | Kanamori, Tadashi Ueno, Machi |
| author_facet | Kanamori, Tadashi Ueno, Machi |
| author_role | aut aut |
| author_sort | Kanamori, Tadashi |
| author_variant | t k tk m u mu |
| building | Verbundindex |
| bvnumber | BV010949202 |
| ctrlnum | (OCoLC)24838889 (DE-599)BVBBV010949202 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01910nam a2200325 cb4500</leader><controlfield tag="001">BV010949202</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">960913s1990 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24838889</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010949202</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">Kanamori, Tadashi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">A fixpoint semantics of Guarded Horn Clauses</subfield><subfield code="c">by T. Kanamori & M. Ueno</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Tokyo, Japan</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">21 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">551</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper presents a fixpoint semantics of flat GHC programs. The framework is parallel to the fixpoint semantics of Prolog programs. First, instead of an atom and a Herbrand interpretation, an atom behavior and a behavior interpretation are considered, where an atom behavior is a finite set of atom pairs (A[sigma], A[tau]), and a behavior interpretation is a set of atom behaviors. Next, instead of the conjunction and the implication for atoms, the parallel conjunction and the guarded implication for atom behaviors are introduced. A transformation T for behavior interpretations associated with a GHC program is defined using those two notions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Then, the semantics of a GHC program is defined as the least fixpoint of the transformation T. The relations to an operational semantics of GHC programs and to the semantics of Prolog programs are discussed as well.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">GHC (Computer program language)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Horn clauses</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Ueno, Machi</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">551</subfield><subfield code="w">(DE-604)BV010923438</subfield><subfield code="9">551</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007323135</subfield></datafield></record></collection> |
| id | DE-604.BV010949202 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:01:32Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007323135 |
| oclc_num | 24838889 |
| open_access_boolean | |
| owner | DE-91G DE-BY-TUM |
| owner_facet | DE-91G DE-BY-TUM |
| physical | 21 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| 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 | Kanamori, Tadashi Verfasser aut A fixpoint semantics of Guarded Horn Clauses by T. Kanamori & M. Ueno Tokyo, Japan 1990 21 S. txt rdacontent n rdamedia nc rdacarrier Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 551 Abstract: "This paper presents a fixpoint semantics of flat GHC programs. The framework is parallel to the fixpoint semantics of Prolog programs. First, instead of an atom and a Herbrand interpretation, an atom behavior and a behavior interpretation are considered, where an atom behavior is a finite set of atom pairs (A[sigma], A[tau]), and a behavior interpretation is a set of atom behaviors. Next, instead of the conjunction and the implication for atoms, the parallel conjunction and the guarded implication for atom behaviors are introduced. A transformation T for behavior interpretations associated with a GHC program is defined using those two notions Then, the semantics of a GHC program is defined as the least fixpoint of the transformation T. The relations to an operational semantics of GHC programs and to the semantics of Prolog programs are discussed as well. GHC (Computer program language) Horn clauses Ueno, Machi Verfasser aut Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report 551 (DE-604)BV010923438 551 |
| spellingShingle | Kanamori, Tadashi Ueno, Machi A fixpoint semantics of Guarded Horn Clauses Shin-Sedai-Konpyūta-Gijutsu-Kaihatsu-Kikō <Tōkyō>: ICOT technical report GHC (Computer program language) Horn clauses |
| title | A fixpoint semantics of Guarded Horn Clauses |
| title_auth | A fixpoint semantics of Guarded Horn Clauses |
| title_exact_search | A fixpoint semantics of Guarded Horn Clauses |
| title_full | A fixpoint semantics of Guarded Horn Clauses by T. Kanamori & M. Ueno |
| title_fullStr | A fixpoint semantics of Guarded Horn Clauses by T. Kanamori & M. Ueno |
| title_full_unstemmed | A fixpoint semantics of Guarded Horn Clauses by T. Kanamori & M. Ueno |
| title_short | A fixpoint semantics of Guarded Horn Clauses |
| title_sort | a fixpoint semantics of guarded horn clauses |
| topic | GHC (Computer program language) Horn clauses |
| topic_facet | GHC (Computer program language) Horn clauses |
| volume_link | (DE-604)BV010923438 |
| work_keys_str_mv | AT kanamoritadashi afixpointsemanticsofguardedhornclauses AT uenomachi afixpointsemanticsofguardedhornclauses |