Strong sequentiality of left-linear overlapping term rewriting systems:
Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normal...
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Buch |
| Sprache: | English |
| Veröffentlicht: |
Amsterdam
1991
|
| Schriftenreihe: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
91,46 |
| Schlagworte: | |
| Zusammenfassung: | Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normalizing for the class of strongly sequential left- linear term rewriting systems in which every critical pair can be joined with root balanced reductions." |
| Beschreibung: | 23 S. graph. Darst. |
Internformat
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV008993164 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 940206s1991 d||| |||| 00||| eng d | ||
| 035 | |a (OCoLC)26365327 | ||
| 035 | |a (DE-599)BVBBV008993164 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 049 | |a DE-29T | ||
| 100 | 1 | |a Toyama, Yoshihito |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Strong sequentiality of left-linear overlapping term rewriting systems |c Y. Toyama |
| 264 | 1 | |a Amsterdam |c 1991 | |
| 300 | |a 23 S. |b graph. Darst. | ||
| 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,46 | |
| 520 | 3 | |a Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normalizing for the class of strongly sequential left- linear term rewriting systems in which every critical pair can be joined with root balanced reductions." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 91,46 |w (DE-604)BV008928356 |9 91,46 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-005941987 | ||
Datensatz im Suchindex
| _version_ | 1804123335664074752 |
|---|---|
| any_adam_object | |
| author | Toyama, Yoshihito |
| author_facet | Toyama, Yoshihito |
| author_role | aut |
| author_sort | Toyama, Yoshihito |
| author_variant | y t yt |
| building | Verbundindex |
| bvnumber | BV008993164 |
| ctrlnum | (OCoLC)26365327 (DE-599)BVBBV008993164 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01454nam a2200289 cb4500</leader><controlfield tag="001">BV008993164</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">940206s1991 d||| |||| 00||| eng d</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)26365327</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV008993164</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">Toyama, Yoshihito</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Strong sequentiality of left-linear overlapping term rewriting systems</subfield><subfield code="c">Y. Toyama</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">23 S.</subfield><subfield code="b">graph. Darst.</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,46</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normalizing for the class of strongly sequential left- linear term rewriting systems in which every critical pair can be joined with root balanced reductions."</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Rewriting systems (Computer science)</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,46</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">91,46</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-005941987</subfield></datafield></record></collection> |
| id | DE-604.BV008993164 |
| illustrated | Illustrated |
| indexdate | 2024-07-09T17:28:08Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-005941987 |
| oclc_num | 26365327 |
| open_access_boolean | |
| owner | DE-29T |
| owner_facet | DE-29T |
| physical | 23 S. graph. Darst. |
| publishDate | 1991 |
| publishDateSearch | 1991 |
| publishDateSort | 1991 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Toyama, Yoshihito Verfasser aut Strong sequentiality of left-linear overlapping term rewriting systems Y. Toyama Amsterdam 1991 23 S. graph. Darst. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 91,46 Abstract: "Huet and Lévy showed that for every strongly sequential orthogonal (i.e., left-linear and non-overlapping) term rewriting system, the index reduction strategy is normalizing. This paper extends their result to overlapping term rewriting systems. We show that index reduction is normalizing for the class of strongly sequential left- linear term rewriting systems in which every critical pair can be joined with root balanced reductions." Rewriting systems (Computer science) Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 91,46 (DE-604)BV008928356 91,46 |
| spellingShingle | Toyama, Yoshihito Strong sequentiality of left-linear overlapping term rewriting systems Rewriting systems (Computer science) |
| title | Strong sequentiality of left-linear overlapping term rewriting systems |
| title_auth | Strong sequentiality of left-linear overlapping term rewriting systems |
| title_exact_search | Strong sequentiality of left-linear overlapping term rewriting systems |
| title_full | Strong sequentiality of left-linear overlapping term rewriting systems Y. Toyama |
| title_fullStr | Strong sequentiality of left-linear overlapping term rewriting systems Y. Toyama |
| title_full_unstemmed | Strong sequentiality of left-linear overlapping term rewriting systems Y. Toyama |
| title_short | Strong sequentiality of left-linear overlapping term rewriting systems |
| title_sort | strong sequentiality of left linear overlapping term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT toyamayoshihito strongsequentialityofleftlinearoverlappingtermrewritingsystems |