Sequentiality in orthogonal term rewriting systems:
Abstract: "For othogonal term rewriting systems, G. Huet and J.-J. Lévy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Lévy, s...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1989
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
89,32 |
| Subjects: | |
| Summary: | Abstract: "For othogonal term rewriting systems, G. Huet and J.-J. Lévy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Lévy, strong sequentiality is a decidable property. In this paper we present an alternative analysis of strongly sequential term rewriting systems, leading to two simplified proofs of the decidability of this property. We also compare some related notions of sequentiality that recently have been proposed." |
| Physical Description: | 38 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV009258288 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940313s1989 |||| 00||| eng d | ||
| 035 | |a (OCoLC)22336124 | ||
| 035 | |a (DE-599)BVBBV009258288 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Klop, Jan Willem |d 1945- |e Verfasser |0 (DE-588)130644498 |4 aut | |
| 245 | 1 | 0 | |a Sequentiality in orthogonal term rewriting systems |c J. W. Klop ; A. Middeldorp |
| 264 | 1 | |a Amsterdam |c 1989 | |
| 300 | |a 38 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,32 | |
| 520 | 3 | |a Abstract: "For othogonal term rewriting systems, G. Huet and J.-J. Lévy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Lévy, strong sequentiality is a decidable property. In this paper we present an alternative analysis of strongly sequential term rewriting systems, leading to two simplified proofs of the decidability of this property. We also compare some related notions of sequentiality that recently have been proposed." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Middeldorp, Aart |d 1963- |e Verfasser |0 (DE-588)121450279 |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 89,32 |w (DE-604)BV008928356 |9 89,32 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006160344 | ||
Record in the Search Index
| _version_ | 1804123705560793088 |
|---|---|
| any_adam_object | |
| author | Klop, Jan Willem 1945- Middeldorp, Aart 1963- |
| author_GND | (DE-588)130644498 (DE-588)121450279 |
| author_facet | Klop, Jan Willem 1945- Middeldorp, Aart 1963- |
| author_role | aut aut |
| author_sort | Klop, Jan Willem 1945- |
| author_variant | j w k jw jwk a m am |
| building | Verbundindex |
| bvnumber | BV009258288 |
| ctrlnum | (OCoLC)22336124 (DE-599)BVBBV009258288 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01674nam a2200301 cb4500</leader><controlfield tag="001">BV009258288</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940313s1989 |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)22336124</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV009258288</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">Klop, Jan Willem</subfield><subfield code="d">1945-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)130644498</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Sequentiality in orthogonal term rewriting systems</subfield><subfield code="c">J. W. Klop ; A. Middeldorp</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">38 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,32</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "For othogonal term rewriting systems, G. Huet and J.-J. Lévy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Lévy, strong sequentiality is a decidable property. In this paper we present an alternative analysis of strongly sequential term rewriting systems, leading to two simplified proofs of the decidability of this property. We also compare some related notions of sequentiality that recently have been proposed."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</subfield></datafield><datafield tag="700" ind1="1" ind2=" "><subfield code="a">Middeldorp, Aart</subfield><subfield code="d">1963-</subfield><subfield code="e">Verfasser</subfield><subfield code="0">(DE-588)121450279</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">89,32</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">89,32</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006160344</subfield></datafield></record></collection> |
| id | DE-604.BV009258288 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:34:01Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006160344 |
| oclc_num | 22336124 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 38 S. |
| publishDate | 1989 |
| publishDateSearch | 1989 |
| publishDateSort | 1989 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Klop, Jan Willem 1945- Verfasser (DE-588)130644498 aut Sequentiality in orthogonal term rewriting systems J. W. Klop ; A. Middeldorp Amsterdam 1989 38 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 89,32 Abstract: "For othogonal term rewriting systems, G. Huet and J.-J. Lévy have introduced the property of 'strong sequentiality'. A strongly sequential orthogonal term rewriting system admits an efficiently computable normalizing one-step reduction strategy. As shown by Huet and Lévy, strong sequentiality is a decidable property. In this paper we present an alternative analysis of strongly sequential term rewriting systems, leading to two simplified proofs of the decidability of this property. We also compare some related notions of sequentiality that recently have been proposed." Rewriting systems (Computer science) Middeldorp, Aart 1963- Verfasser (DE-588)121450279 aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 89,32 (DE-604)BV008928356 89,32 |
| spellingShingle | Klop, Jan Willem 1945- Middeldorp, Aart 1963- Sequentiality in orthogonal term rewriting systems Rewriting systems (Computer science) |
| title | Sequentiality in orthogonal term rewriting systems |
| title_auth | Sequentiality in orthogonal term rewriting systems |
| title_exact_search | Sequentiality in orthogonal term rewriting systems |
| title_full | Sequentiality in orthogonal term rewriting systems J. W. Klop ; A. Middeldorp |
| title_fullStr | Sequentiality in orthogonal term rewriting systems J. W. Klop ; A. Middeldorp |
| title_full_unstemmed | Sequentiality in orthogonal term rewriting systems J. W. Klop ; A. Middeldorp |
| title_short | Sequentiality in orthogonal term rewriting systems |
| title_sort | sequentiality in orthogonal term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT klopjanwillem sequentialityinorthogonaltermrewritingsystems AT middeldorpaart sequentialityinorthogonaltermrewritingsystems |