Conditional rewriting logic as a unified model of concurrency:
Gespeichert in:
| Beteilige Person: | |
|---|---|
| Format: | Buch |
| Sprache: | Englisch |
| Veröffentlicht: |
Stanford, Calif.
1991
|
| Schriftenreihe: | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL
91,5 |
| Schlagwörter: | |
| Abstract: | Abstract: "Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency. Concurrent rewriting coincides with logical deduction in conditional rewriting logic, a logic of actions whose models are concurrent systems. This logic is sound and complete and has initial models. In addition to general models interpreted as concurrent systems which provide a more operational style of semantics, more restricted semantics with an incresingly [sic] denotational flavor such as preorder, poset, cpo, and standard algebraic models appear as special cases of the model theory This permits dealing with operational and denotational issues within the same model theory and logic. A programming language called Maude whose modules are rewriting logic theories is defined and given denotational and operational semantics. Maude provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems. |
| Umfang: | 63 S. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009224826 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t| | ||
| 008 | 940313s1991 xx |||| 00||| eng d | ||
| 035 | |a (OCoLC)24764520 | ||
| 035 | |a (DE-599)BVBBV009224826 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Meseguer, José |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Conditional rewriting logic as a unified model of concurrency |c José Meseguer |
| 264 | 1 | |a Stanford, Calif. |c 1991 | |
| 300 | |a 63 S. | ||
| 336 | |b txt |2 rdacontent | ||
| 337 | |b n |2 rdamedia | ||
| 338 | |b nc |2 rdacarrier | ||
| 490 | 1 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 91,5 | |
| 520 | 3 | |a Abstract: "Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency. Concurrent rewriting coincides with logical deduction in conditional rewriting logic, a logic of actions whose models are concurrent systems. This logic is sound and complete and has initial models. In addition to general models interpreted as concurrent systems which provide a more operational style of semantics, more restricted semantics with an incresingly [sic] denotational flavor such as preorder, poset, cpo, and standard algebraic models appear as special cases of the model theory | |
| 520 | 3 | |a This permits dealing with operational and denotational issues within the same model theory and logic. A programming language called Maude whose modules are rewriting logic theories is defined and given denotational and operational semantics. Maude provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems. | |
| 650 | 4 | |a Parallel processing (Electronic computers) | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 830 | 0 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 91,5 |w (DE-604)BV008930658 |9 91,5 | |
| 943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-006133981 | |
Datensatz im Suchindex
| _version_ | 1818951444163723264 |
|---|---|
| any_adam_object | |
| author | Meseguer, José |
| author_facet | Meseguer, José |
| author_role | aut |
| author_sort | Meseguer, José |
| author_variant | j m jm |
| building | Verbundindex |
| bvnumber | BV009224826 |
| ctrlnum | (OCoLC)24764520 (DE-599)BVBBV009224826 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02080nam a2200313 cb4500</leader><controlfield tag="001">BV009224826</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)24764520</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009224826</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">Meseguer, José</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Conditional rewriting logic as a unified model of concurrency</subfield><subfield code="c">José Meseguer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1991</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">63 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">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">91,5</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency. Concurrent rewriting coincides with logical deduction in conditional rewriting logic, a logic of actions whose models are concurrent systems. This logic is sound and complete and has initial models. In addition to general models interpreted as concurrent systems which provide a more operational style of semantics, more restricted semantics with an incresingly [sic] denotational flavor such as preorder, poset, cpo, and standard algebraic models appear as special cases of the model theory</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">This permits dealing with operational and denotational issues within the same model theory and logic. A programming language called Maude whose modules are rewriting logic theories is defined and given denotational and operational semantics. Maude provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Parallel processing (Electronic computers)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="830" ind1=" " ind2="0"><subfield code="a">Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL</subfield><subfield code="v">91,5</subfield><subfield code="w">(DE-604)BV008930658</subfield><subfield code="9">91,5</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006133981</subfield></datafield></record></collection> |
| id | DE-604.BV009224826 |
| illustrated | Not Illustrated |
| indexdate | 2024-12-20T09:34:35Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006133981 |
| oclc_num | 24764520 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 63 S. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| series2 | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |
| spelling | Meseguer, José Verfasser aut Conditional rewriting logic as a unified model of concurrency José Meseguer Stanford, Calif. 1991 63 S. txt rdacontent n rdamedia nc rdacarrier Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 91,5 Abstract: "Rewriting with conditional rewrite rules modulo a set E of structural axioms provides a general framework for unifying a wide variety of models of concurrency. Concurrent rewriting coincides with logical deduction in conditional rewriting logic, a logic of actions whose models are concurrent systems. This logic is sound and complete and has initial models. In addition to general models interpreted as concurrent systems which provide a more operational style of semantics, more restricted semantics with an incresingly [sic] denotational flavor such as preorder, poset, cpo, and standard algebraic models appear as special cases of the model theory This permits dealing with operational and denotational issues within the same model theory and logic. A programming language called Maude whose modules are rewriting logic theories is defined and given denotational and operational semantics. Maude provides a simple unification of concurrent programming with functional and object-oriented programming and supports high level declarative programming of concurrent systems. Parallel processing (Electronic computers) Rewriting systems (Computer science) Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 91,5 (DE-604)BV008930658 91,5 |
| spellingShingle | Meseguer, José Conditional rewriting logic as a unified model of concurrency Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL Parallel processing (Electronic computers) Rewriting systems (Computer science) |
| title | Conditional rewriting logic as a unified model of concurrency |
| title_auth | Conditional rewriting logic as a unified model of concurrency |
| title_exact_search | Conditional rewriting logic as a unified model of concurrency |
| title_full | Conditional rewriting logic as a unified model of concurrency José Meseguer |
| title_fullStr | Conditional rewriting logic as a unified model of concurrency José Meseguer |
| title_full_unstemmed | Conditional rewriting logic as a unified model of concurrency José Meseguer |
| title_short | Conditional rewriting logic as a unified model of concurrency |
| title_sort | conditional rewriting logic as a unified model of concurrency |
| topic | Parallel processing (Electronic computers) Rewriting systems (Computer science) |
| topic_facet | Parallel processing (Electronic computers) Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008930658 |
| work_keys_str_mv | AT meseguerjose conditionalrewritinglogicasaunifiedmodelofconcurrency |