Semantic models for a version of PARLOG:
Abstract: "This paper gives four semantics for PARLOG: two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set of a PARLOG program, that is, the set of computed answer subst...
Saved in:
| Format: | Book |
|---|---|
| Language: | English |
| Published: |
Amsterdam
1989
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,51 |
| Subjects: | |
| Summary: | Abstract: "This paper gives four semantics for PARLOG: two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set of a PARLOG program, that is, the set of computed answer substitutions corresponding to all successfully terminating computations. The other operational and the denotational semantics model also deadlock and infinite computations. For the declarative and the denotational semantics we extend standard notions like unification in order to cope with the synchronization mechanism of PARLOG. The basic mathematical structure for the declarative semantics is the set of finite streams of substitutions In the denotational semantics we use tree-like structures that are labelled with streams of substitutions. We look at the relations between the different models: First we relate the two operational semantics and next we show the relation of the declarative and denotational semantics with their operational counterparts. |
| Physical Description: | 30 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008949499 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22516883 | ||
| 035 | |a (DE-599)BVBBV008949499 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 245 | 1 | 0 | |a Semantic models for a version of PARLOG |c Frank S. de Boer ... |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 30 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |v 89,51 | |
| 520 | 3 | |a Abstract: "This paper gives four semantics for PARLOG: two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set of a PARLOG program, that is, the set of computed answer substitutions corresponding to all successfully terminating computations. The other operational and the denotational semantics model also deadlock and infinite computations. For the declarative and the denotational semantics we extend standard notions like unification in order to cope with the synchronization mechanism of PARLOG. The basic mathematical structure for the declarative semantics is the set of finite streams of substitutions | |
| 520 | 3 | |a In the denotational semantics we use tree-like structures that are labelled with streams of substitutions. We look at the relations between the different models: First we relate the two operational semantics and next we show the relation of the declarative and denotational semantics with their operational counterparts. | |
| 650 | 4 | |a Logic programming | |
| 650 | 4 | |a Programming languages (Electronic computers) |x Semantics | |
| 700 | 1 | |a Boer, Frank S. de |e Sonstige |4 oth | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,51 |w (DE-604)BV008928356 |9 89,51 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005905156 | ||
Record in the Search Index
| _version_ | 1804123282602983424 |
|---|---|
| any_adam_object | |
| building | Verbundindex |
| bvnumber | BV008949499 |
| ctrlnum | (OCoLC)22516883 (DE-599)BVBBV008949499 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02089nam a2200313 cb4500</leader><controlfield tag="001">BV008949499</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22516883</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008949499</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-29T</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Semantic models for a version of PARLOG</subfield><subfield code="c">Frank S. de Boer ...</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1989</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">30 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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">89,51</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper gives four semantics for PARLOG: two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set of a PARLOG program, that is, the set of computed answer substitutions corresponding to all successfully terminating computations. The other operational and the denotational semantics model also deadlock and infinite computations. For the declarative and the denotational semantics we extend standard notions like unification in order to cope with the synchronization mechanism of PARLOG. The basic mathematical structure for the declarative semantics is the set of finite streams of substitutions</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">In the denotational semantics we use tree-like structures that are labelled with streams of substitutions. We look at the relations between the different models: First we relate the two operational semantics and next we show the relation of the declarative and denotational semantics with their operational counterparts.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Programming languages (Electronic computers)</subfield><subfield code="x">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Boer, Frank S. de</subfield><subfield code="e">Sonstige</subfield><subfield code="4">oth</subfield></datafield><datafield tag="810" ind1="2" ind2=" "><subfield code="a">Department of Computer Science: Report CS</subfield><subfield code="t">Centrum voor Wiskunde en Informatica <Amsterdam></subfield><subfield code="v">89,51</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,51</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005905156</subfield></datafield></record></collection> |
| id | DE-604.BV008949499 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:18Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005905156 |
| oclc_num | 22516883 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 30 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Semantic models for a version of PARLOG Frank S. de Boer ... Amsterdam 1989 30 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,51 Abstract: "This paper gives four semantics for PARLOG: two operational semantics based on a transition system, a declarative semantics and a denotational semantics. One operational and the declarative semantics model the success set of a PARLOG program, that is, the set of computed answer substitutions corresponding to all successfully terminating computations. The other operational and the denotational semantics model also deadlock and infinite computations. For the declarative and the denotational semantics we extend standard notions like unification in order to cope with the synchronization mechanism of PARLOG. The basic mathematical structure for the declarative semantics is the set of finite streams of substitutions In the denotational semantics we use tree-like structures that are labelled with streams of substitutions. We look at the relations between the different models: First we relate the two operational semantics and next we show the relation of the declarative and denotational semantics with their operational counterparts. Logic programming Programming languages (Electronic computers) Semantics Boer, Frank S. de Sonstige oth Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,51 (DE-604)BV008928356 89,51 |
| spellingShingle | Semantic models for a version of PARLOG Logic programming Programming languages (Electronic computers) Semantics |
| title | Semantic models for a version of PARLOG |
| title_auth | Semantic models for a version of PARLOG |
| title_exact_search | Semantic models for a version of PARLOG |
| title_full | Semantic models for a version of PARLOG Frank S. de Boer ... |
| title_fullStr | Semantic models for a version of PARLOG Frank S. de Boer ... |
| title_full_unstemmed | Semantic models for a version of PARLOG Frank S. de Boer ... |
| title_short | Semantic models for a version of PARLOG |
| title_sort | semantic models for a version of parlog |
| topic | Logic programming Programming languages (Electronic computers) Semantics |
| topic_facet | Logic programming Programming languages (Electronic computers) Semantics |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT boerfranksde semanticmodelsforaversionofparlog |