Minimal term rewriting systems:
Abstract: "Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Book |
| Language: | English |
| Published: |
Amsterdam
1995
|
| Series: | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS
9573 |
| Subjects: | |
| Summary: | Abstract: "Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM." |
| Physical Description: | 16 S. |
Staff View
MARC
| LEADER | 00000nam a2200000 cb4500 | ||
|---|---|---|---|
| 001 | BV011065128 | ||
| 003 | DE-604 | ||
| 005 | 00000000000000.0 | ||
| 007 | t | ||
| 008 | 961118s1995 |||| 00||| engod | ||
| 035 | |a (OCoLC)1069140560 | ||
| 035 | |a (DE-599)BVBBV011065128 | ||
| 040 | |a DE-604 |b ger |e rakddb | ||
| 041 | 0 | |a eng | |
| 100 | 1 | |a Walters, Humphrey R. |e Verfasser |4 aut | |
| 245 | 1 | 0 | |a Minimal term rewriting systems |c H. R. Walters ; J. F. Th. Kamperman |
| 264 | 1 | |a Amsterdam |c 1995 | |
| 300 | |a 16 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 9573 | |
| 520 | 3 | |a Abstract: "Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM." | |
| 650 | 4 | |a Rewriting systems (Computer science) | |
| 700 | 1 | |a Kamperman, Jasper F. |e Verfasser |4 aut | |
| 810 | 2 | |a Department of Computer Science: Report CS |t Centrum voor Wiskunde en Informatica <Amsterdam> |v 9573 |w (DE-604)BV008928356 |9 9573 | |
| 999 | |a oai:aleph.bib-bvb.de:BVB01-007410996 | ||
Record in the Search Index
| _version_ | 1804125554335547392 |
|---|---|
| any_adam_object | |
| author | Walters, Humphrey R. Kamperman, Jasper F. |
| author_facet | Walters, Humphrey R. Kamperman, Jasper F. |
| author_role | aut aut |
| author_sort | Walters, Humphrey R. |
| author_variant | h r w hr hrw j f k jf jfk |
| building | Verbundindex |
| bvnumber | BV011065128 |
| ctrlnum | (OCoLC)1069140560 (DE-599)BVBBV011065128 |
| format | Book |
| fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01562nam a2200289 cb4500</leader><controlfield tag="001">BV011065128</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">00000000000000.0</controlfield><controlfield tag="007">t</controlfield><controlfield tag="008">961118s1995 |||| 00||| engod</controlfield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1069140560</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)BVBBV011065128</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">Walters, Humphrey R.</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Minimal term rewriting systems</subfield><subfield code="c">H. R. Walters ; J. F. Th. Kamperman</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Amsterdam</subfield><subfield code="c">1995</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">16 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">9573</subfield></datafield><datafield tag="520" ind1="3" ind2=" "><subfield code="a">Abstract: "Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM."</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">Kamperman, Jasper F.</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">9573</subfield><subfield code="w">(DE-604)BV008928356</subfield><subfield code="9">9573</subfield></datafield><datafield tag="999" ind1=" " ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-007410996</subfield></datafield></record></collection> |
| id | DE-604.BV011065128 |
| illustrated | Not Illustrated |
| indexdate | 2024-07-09T18:03:24Z |
| institution | BVB |
| language | English |
| oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-007410996 |
| oclc_num | 1069140560 |
| open_access_boolean | |
| physical | 16 S. |
| publishDate | 1995 |
| publishDateSearch | 1995 |
| publishDateSort | 1995 |
| record_format | marc |
| series2 | Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS |
| spelling | Walters, Humphrey R. Verfasser aut Minimal term rewriting systems H. R. Walters ; J. F. Th. Kamperman Amsterdam 1995 16 S. txt rdacontent n rdamedia nc rdacarrier Centrum voor Wiskunde en Informatica <Amsterdam> / Department of Computer Science: Report CS 9573 Abstract: "Formally well-founded compilation techniques for Term Rewriting Systems (TRSs) are presented. TRSs are compiled into Minimal Term Rewriting Systems (MTRSs), a subclass of TRSs in which all rules have an extremely simple form. A notion of simulation of (rewrite) relations is presented, under which an MTRSs can be said to simulate a TRS. The MTRS rules can be directly interpreted as instructions for an extremely simple Abstract Rewriting Machine (ARM). Favourable practical results have already been obtained with an earlier version of ARM." Rewriting systems (Computer science) Kamperman, Jasper F. Verfasser aut Department of Computer Science: Report CS Centrum voor Wiskunde en Informatica <Amsterdam> 9573 (DE-604)BV008928356 9573 |
| spellingShingle | Walters, Humphrey R. Kamperman, Jasper F. Minimal term rewriting systems Rewriting systems (Computer science) |
| title | Minimal term rewriting systems |
| title_auth | Minimal term rewriting systems |
| title_exact_search | Minimal term rewriting systems |
| title_full | Minimal term rewriting systems H. R. Walters ; J. F. Th. Kamperman |
| title_fullStr | Minimal term rewriting systems H. R. Walters ; J. F. Th. Kamperman |
| title_full_unstemmed | Minimal term rewriting systems H. R. Walters ; J. F. Th. Kamperman |
| title_short | Minimal term rewriting systems |
| title_sort | minimal term rewriting systems |
| topic | Rewriting systems (Computer science) |
| topic_facet | Rewriting systems (Computer science) |
| volume_link | (DE-604)BV008928356 |
| work_keys_str_mv | AT waltershumphreyr minimaltermrewritingsystems AT kampermanjasperf minimaltermrewritingsystems |