Conditional rewriting logic: deduction, models and concurrency
Abstract: "Term rewriting has so far been understood almost exclusively as a technique for equational reasoning. This paper proposes a much broader interpretation in which term rewriting can be used both as a semantic foundation and as a programming paradigm in areas such as reactive systems, c...
Saved in:
| Main Author: | |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Stanford, Calif.
1990
|
| Series: | Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL
90,14 |
| Subjects: | |
| Summary: | Abstract: "Term rewriting has so far been understood almost exclusively as a technique for equational reasoning. This paper proposes a much broader interpretation in which term rewriting can be used both as a semantic foundation and as a programming paradigm in areas such as reactive systems, concurrency theory and object-oriented programming that do not fit naturally within the functional world of equational logic. The interpretation proposed views conditional rewritting as a logic in its own right, with its own proof theory and with a very general model theory of wide applicability. The logic is sound and complete and admits initial models Equational logic appears as a special refinement of the general framework; this supports a natural unification of the functional and concurrent programming paradigms with a purely declarative style. Throughout the paper, the concurrent nature of term rewriting is emphasized; the role of rewriting as a unified model of concurrency is also discussed. |
| Physical Description: | 28 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008974621 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1990 |||| 00||| eng d | ||
| 035 | |a (OCoLC)25667044 | ||
| 035 | |a (DE-599)BVBBV008974621 | ||
| 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 |b deduction, models and concurrency |c José Meseguer |
| 264 | 1 | |a Stanford, Calif. |c 1990 | |
| 300 | |a 28 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 90,14 | |
| 520 | 3 | |a Abstract: "Term rewriting has so far been understood almost exclusively as a technique for equational reasoning. This paper proposes a much broader interpretation in which term rewriting can be used both as a semantic foundation and as a programming paradigm in areas such as reactive systems, concurrency theory and object-oriented programming that do not fit naturally within the functional world of equational logic. The interpretation proposed views conditional rewritting as a logic in its own right, with its own proof theory and with a very general model theory of wide applicability. The logic is sound and complete and admits initial models | |
| 520 | 3 | |a Equational logic appears as a special refinement of the general framework; this supports a natural unification of the functional and concurrent programming paradigms with a purely declarative style. Throughout the paper, the concurrent nature of term rewriting is emphasized; the role of rewriting as a unified model of concurrency is also discussed. | |
| 650 | 4 | |a Computer programming | |
| 650 | 4 | |a Logic, Symbolic and mathematical | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 830 | 0 | |a Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL |v 90,14 |w (DE-604)BV008930658 |9 90,14 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005926173 | ||
Record in the Search Index
| _version_ | 1804123312685580288 |
|---|---|
| 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 | BV008974621 |
| ctrlnum | (OCoLC)25667044 (DE-599)BVBBV008974621 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02025nam a2200325 cb4500</leader><controlfield tag="001">BV008974621</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1990 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)25667044</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008974621</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</subfield><subfield code="b">deduction, models and concurrency</subfield><subfield code="c">José Meseguer</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Stanford, Calif.</subfield><subfield code="c">1990</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">28 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">90,14</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Term rewriting has so far been understood almost exclusively as a technique for equational reasoning. This paper proposes a much broader interpretation in which term rewriting can be used both as a semantic foundation and as a programming paradigm in areas such as reactive systems, concurrency theory and object-oriented programming that do not fit naturally within the functional world of equational logic. The interpretation proposed views conditional rewritting as a logic in its own right, with its own proof theory and with a very general model theory of wide applicability. The logic is sound and complete and admits initial models</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Equational logic appears as a special refinement of the general framework; this supports a natural unification of the functional and concurrent programming paradigms with a purely declarative style. Throughout the paper, the concurrent nature of term rewriting is emphasized; the role of rewriting as a unified model of concurrency is also discussed.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer programming</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Logic, Symbolic and mathematical</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">90,14</subfield><subfield code="w">(DE-604)BV008930658</subfield><subfield code="9">90,14</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005926173</subfield></datafield></record></collection> |
| id | DE-604.BV008974621 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:27:46Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005926173 |
| oclc_num | 25667044 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 28 S. |
| publishDate | 1990 |
| publishDateSearch | 1990 |
| publishDateSort | 1990 |
| 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 deduction, models and concurrency José Meseguer Stanford, Calif. 1990 28 S. txt rdacontent n rdamedia nc rdacarrier Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 90,14 Abstract: "Term rewriting has so far been understood almost exclusively as a technique for equational reasoning. This paper proposes a much broader interpretation in which term rewriting can be used both as a semantic foundation and as a programming paradigm in areas such as reactive systems, concurrency theory and object-oriented programming that do not fit naturally within the functional world of equational logic. The interpretation proposed views conditional rewritting as a logic in its own right, with its own proof theory and with a very general model theory of wide applicability. The logic is sound and complete and admits initial models Equational logic appears as a special refinement of the general framework; this supports a natural unification of the functional and concurrent programming paradigms with a purely declarative style. Throughout the paper, the concurrent nature of term rewriting is emphasized; the role of rewriting as a unified model of concurrency is also discussed. Computer programming Logic, Symbolic and mathematical Rewriting systems (Computer science) Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL 90,14 (DE-604)BV008930658 90,14 |
| spellingShingle | Meseguer, José Conditional rewriting logic deduction, models and concurrency Computer Science Laboratory <Menlo Park, Calif.>: SRI-CSL Computer programming Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| title | Conditional rewriting logic deduction, models and concurrency |
| title_auth | Conditional rewriting logic deduction, models and concurrency |
| title_exact_search | Conditional rewriting logic deduction, models and concurrency |
| title_full | Conditional rewriting logic deduction, models and concurrency José Meseguer |
| title_fullStr | Conditional rewriting logic deduction, models and concurrency José Meseguer |
| title_full_unstemmed | Conditional rewriting logic deduction, models and concurrency José Meseguer |
| title_short | Conditional rewriting logic |
| title_sort | conditional rewriting logic deduction models and concurrency |
| title_sub | deduction, models and concurrency |
| topic | Computer programming Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| topic_facet | Computer programming Logic, Symbolic and mathematical Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008930658 |
| work_keys_str_mv | AT meseguerjose conditionalrewritinglogicdeductionmodelsandconcurrency |