Object-oriented tree traversal with J. J. Forester
Science of Computer Programming - Special issue: Language descriptions, tools and applications (LDTA'01)
Strategic programming meets adaptive programming
Proceedings of the 2nd international conference on Aspect-oriented software development
Term rewriting with traversal functions
ACM Transactions on Software Engineering and Methodology (TOSEM)
Environments for term rewriting engines for free!
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
The SSP: an example of high-assurance systems engineering
HASE'04 Proceedings of the Eighth IEEE international conference on High assurance systems engineering
| Hi-index | 0.00 |
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.