Comparing combinatory reduction systems and higher-order rewrite systems:
Abstract: "In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop and Higher- order Rewrite Systems defined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relatio...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1993
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
93,61 |
| Subjects: | |
| Summary: | Abstract: "In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop and Higher- order Rewrite Systems defined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs for much related frameworks were given twice. We present two translations, one from Combinatory Reduction Systems into Higher-Order Rewrite Systems and one vice versa, based on a detailed comparison of both formats Since the translations are very 'neat' in the sense that the rewrite relation is preserved and (almost) reflected, we can conclude that as far as rewrite theory is concerned, Combinatory Reduction Systems and Higher-Order Rewrite Systems are equivalent, the only difference being that Combinatory Reduction Systems employ a more 'lazy' evaluation strategy. Moreover, due to this result it is the case that some syntactic properties derived for the one class also hold for the other. |
| Physical Description: | 30 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV010176850 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 950510s1993 |||| 00||| engod | ||
| 035 | |a (OCoLC)31372903 | ||
| 035 | |a (DE-599)BVBBV010176850 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Oostrom, Vincent van |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Comparing combinatory reduction systems and higher-order rewrite systems |c V. van Oostrom ; F. van Raamsdonk |
| 264 | 1 | |a Amsterdam |c 1993 | |
| 300 | |a 30 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 93,61 | |
| 520 | 3 | |a Abstract: "In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop and Higher- order Rewrite Systems defined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs for much related frameworks were given twice. We present two translations, one from Combinatory Reduction Systems into Higher-Order Rewrite Systems and one vice versa, based on a detailed comparison of both formats | |
| 520 | 3 | |a Since the translations are very 'neat' in the sense that the rewrite relation is preserved and (almost) reflected, we can conclude that as far as rewrite theory is concerned, Combinatory Reduction Systems and Higher-Order Rewrite Systems are equivalent, the only difference being that Combinatory Reduction Systems employ a more 'lazy' evaluation strategy. Moreover, due to this result it is the case that some syntactic properties derived for the one class also hold for the other. | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Raamsdonk, Femke van |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 93,61 |w (DE-604)BV008928356 |9 93,61 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-006759483 | ||
Record in the Search Index
| _version_ | 1804124574504189952 |
|---|---|
| any_adam_object | |
| author | Oostrom, Vincent van Raamsdonk, Femke van |
| author_facet | Oostrom, Vincent van Raamsdonk, Femke van |
| author_role | aut aut |
| author_sort | Oostrom, Vincent van |
| author_variant | v v o vv vvo f v r fv fvr |
| building | Verbundindex |
| bvnumber | BV010176850 |
| ctrlnum | (OCoLC)31372903 (DE-599)BVBBV010176850 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02158nam a2200301 cb4500</leader><controlfield tag="001">BV010176850</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">950510s1993 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)31372903</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV010176850</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="100" ind1="1" ind2=" "><subfield code="a">Oostrom, Vincent van</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Comparing combinatory reduction systems and higher-order rewrite systems</subfield><subfield code="c">V. van Oostrom ; F. van Raamsdonk</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1993</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">30 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">93,61</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop and Higher- order Rewrite Systems defined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs for much related frameworks were given twice. We present two translations, one from Combinatory Reduction Systems into Higher-Order Rewrite Systems and one vice versa, based on a detailed comparison of both formats</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Since the translations are very 'neat' in the sense that the rewrite relation is preserved and (almost) reflected, we can conclude that as far as rewrite theory is concerned, Combinatory Reduction Systems and Higher-Order Rewrite Systems are equivalent, the only difference being that Combinatory Reduction Systems employ a more 'lazy' evaluation strategy. Moreover, due to this result it is the case that some syntactic properties derived for the one class also hold for the other.</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">Raamsdonk, Femke van</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">93,61</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">93,61</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-006759483</subfield></datafield></record></collection> |
| id | DE-604.BV010176850 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T17:47:50Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-006759483 |
| oclc_num | 31372903 |
| open_access_boolean | |
| physical | 30 S. |
| publishDate | 1993 |
| publishDateSearch | 1993 |
| publishDateSort | 1993 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Oostrom, Vincent van Verfasser aut Comparing combinatory reduction systems and higher-order rewrite systems V. van Oostrom ; F. van Raamsdonk Amsterdam 1993 30 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 93,61 Abstract: "In this paper two formats of higher-order rewriting are compared: Combinatory Reduction Systems introduced by Klop and Higher- order Rewrite Systems defined by Nipkow. Although it always has been obvious that both formats are closely related to each other, up to now the exact relationship between them has not been clear. This was an unsatisfying situation since it meant that proofs for much related frameworks were given twice. We present two translations, one from Combinatory Reduction Systems into Higher-Order Rewrite Systems and one vice versa, based on a detailed comparison of both formats Since the translations are very 'neat' in the sense that the rewrite relation is preserved and (almost) reflected, we can conclude that as far as rewrite theory is concerned, Combinatory Reduction Systems and Higher-Order Rewrite Systems are equivalent, the only difference being that Combinatory Reduction Systems employ a more 'lazy' evaluation strategy. Moreover, due to this result it is the case that some syntactic properties derived for the one class also hold for the other. Rewriting systems (Computer science) Raamsdonk, Femke van Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 93,61 (DE-604)BV008928356 93,61 |
| spellingShingle | Oostrom, Vincent van Raamsdonk, Femke van Comparing combinatory reduction systems and higher-order rewrite systems Rewriting systems (Computer science) |
| title | Comparing combinatory reduction systems and higher-order rewrite systems |
| title_auth | Comparing combinatory reduction systems and higher-order rewrite systems |
| title_exact_search | Comparing combinatory reduction systems and higher-order rewrite systems |
| title_full | Comparing combinatory reduction systems and higher-order rewrite systems V. van Oostrom ; F. van Raamsdonk |
| title_fullStr | Comparing combinatory reduction systems and higher-order rewrite systems V. van Oostrom ; F. van Raamsdonk |
| title_full_unstemmed | Comparing combinatory reduction systems and higher-order rewrite systems V. van Oostrom ; F. van Raamsdonk |
| title_short | Comparing combinatory reduction systems and higher-order rewrite systems |
| title_sort | comparing combinatory reduction systems and higher order rewrite systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT oostromvincentvan comparingcombinatoryreductionsystemsandhigherorderrewritesystems AT raamsdonkfemkevan comparingcombinatoryreductionsystemsandhigherorderrewritesystems |