Embedding as a tool for language comparison:
Gespeichert in:
Beteiligte Personen: | , |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Amsterdam
1991
|
Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,2 |
Schlagwörter: | |
Abstract: | Abstract: "This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent logic languages. We refine the basic notion of embedding [13] by adding some 'reasonable' conditions, specific for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing the different degree of their expressivity. We show that this preorder is not trivial (i.e. it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, whilst the converses hold." |
Umfang: | 20 S. |
Internformat
MARC
LEADER | 00000nam a2200000 cb4500 | ||
---|---|---|---|
001 | BV009224560 | ||
003 | DE-604 | ||
005 | 00000000000000.0 | ||
007 | t| | ||
008 | 940313s1991 xx |||| 00||| eng d | ||
035 | |a (OCoLC)24806945 | ||
035 | |a (DE-599)BVBBV009224560 | ||
040 | |a DE-604 |b ger |e rakddb | ||
041 | 0 | |a eng | |
049 | |a DE-29T | ||
100 | 1 | |a Boer, Frank S. de |e Verfasser |4 aut | |
245 | 1 | 0 | |a Embedding as a tool for language comparison |c F. S. de Boer ; C. Palamidessi |
264 | 1 | |a Amsterdam |c 1991 | |
300 | |a 20 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 91,2 | |
520 | 3 | |a Abstract: "This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent logic languages. We refine the basic notion of embedding [13] by adding some 'reasonable' conditions, specific for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing the different degree of their expressivity. We show that this preorder is not trivial (i.e. it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, whilst the converses hold." | |
650 | 4 | |a Logic programming | |
650 | 4 | |a Programming languages (Electronic computers) | |
650 | 4 | |a Semantics | |
700 | 1 | |a Palamidessi, Catuscia |e Verfasser |4 aut | |
810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,2 |w (DE-604)BV008928356 |9 91,2 | |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006133796 |
Datensatz im Suchindex
_version_ | 1818951443870121984 |
---|---|
any_adam_object | |
author | Boer, Frank S. de Palamidessi, Catuscia |
author_facet | Boer, Frank S. de Palamidessi, Catuscia |
author_role | aut aut |
author_sort | Boer, Frank S. de |
author_variant | f s d b fsd fsdb c p cp |
building | Verbundindex |
bvnumber | BV009224560 |
ctrlnum | (OCoLC)24806945 (DE-599)BVBBV009224560 |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01802nam a2200325 cb4500</leader><controlfield tag="001">BV009224560</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">940313s1991 xx |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)24806945</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224560</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="100" ind1="1" ind2=" "><subfield code="a">Boer, Frank S. de</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Embedding as a tool for language comparison</subfield><subfield code="c">F. S. de Boer ; C. Palamidessi</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1991</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">Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS</subfield><subfield code="v">91,2</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent logic languages. We refine the basic notion of embedding [13] by adding some 'reasonable' conditions, specific for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing the different degree of their expressivity. We show that this preorder is not trivial (i.e. it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, whilst the converses hold."</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></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Semantics</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Palamidessi, Catuscia</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</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">91,2</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,2</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133796</subfield></datafield></record></collection> |
id | DE-604.BV009224560 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T09:34:34Z |
institution | BVB |
language | English |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133796 |
oclc_num | 24806945 |
open_access_boolean | |
owner | DE-29T |
owner_facet | DE-29T |
physical | 20 S. |
publishDate | 1991 |
publishDateSearch | 1991 |
publishDateSort | 1991 |
record_format | marc |
series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
spelling | Boer, Frank S. de Verfasser aut Embedding as a tool for language comparison F. S. de Boer ; C. Palamidessi Amsterdam 1991 20 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,2 Abstract: "This paper addresses the problem of defining a formal tool to compare the expressive power of different concurrent logic languages. We refine the basic notion of embedding [13] by adding some 'reasonable' conditions, specific for concurrent frameworks. The new notion, called modular embedding, is used to define a preorder among these languages, representing the different degree of their expressivity. We show that this preorder is not trivial (i.e. it does not collapse into one equivalence class) by proving that Flat CP cannot be embedded into Flat GHC, and that Flat GHC cannot be embedded into a language without communication primitives in the guards, whilst the converses hold." Logic programming Programming languages (Electronic computers) Semantics Palamidessi, Catuscia Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,2 (DE-604)BV008928356 91,2 |
spellingShingle | Boer, Frank S. de Palamidessi, Catuscia Embedding as a tool for language comparison Logic programming Programming languages (Electronic computers) Semantics |
title | Embedding as a tool for language comparison |
title_auth | Embedding as a tool for language comparison |
title_exact_search | Embedding as a tool for language comparison |
title_full | Embedding as a tool for language comparison F. S. de Boer ; C. Palamidessi |
title_fullStr | Embedding as a tool for language comparison F. S. de Boer ; C. Palamidessi |
title_full_unstemmed | Embedding as a tool for language comparison F. S. de Boer ; C. Palamidessi |
title_short | Embedding as a tool for language comparison |
title_sort | embedding as a tool for language comparison |
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 embeddingasatoolforlanguagecomparison AT palamidessicatuscia embeddingasatoolforlanguagecomparison |