| Title | Term rewriting with traversal functions |
| Publication Type | Book Chapter |
| Year of Publication | 2001 |
| Authors | van den Brand M, Klint P, Vinju JJ |
| Book Title | 174 |
| Pagination | 35 |
| Publisher | Centrum voor Wiskunde en Informatica (CWI) |
| City | ISSN 1386-369X |
| Keywords | Term rewriting. Tree traversal. Rewriting strategies. ASF+SDF, Types |
| Abstract | Term rewriting is an appealing technique for performing program analysis and program transformation. Tree (term) traversal is frequently used but is not supported by standard term rewriting. We extend many-sorted, first-order term rewriting with \emph{traversal functions} that automate tree traversal in a simple and type safe way. Traversal functions can be bottom-up or top-down traversals. They can be either sort preserving transformations, or mappings to a fixed sort. We give examples and describe the semantics and implementation of traversal functions. |
| URL | http://www.cwi.nl/ftp/CWIreports/SEN/SEN-R0121.ps.Z |