Term Rewriting with Type-safe Traversal Functions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2002

Term Rewriting with Type-safe Traversal Functions


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. In this paper, many-sorted first-order term rewriting is extended with automatic tree traversal by adding two primitive tree traversal strategies and complementing them with three types of traversals. These so-called traversal functions can be either top-down or bottom-up. They can be sort preserving, mapping to a single sort, or a combination of these two. Traversal functiona have a simple design, their application is type-safe in a first-order many-sorted setting and can be implemented efficiently. We describe the operational semantics of traversal functions and discuss applications.


Other [cs.OH]
Not file

Dates and versions

inria-00101030 , version 1 (26-09-2006)


  • HAL Id : inria-00101030 , version 1


Mark G. J. van den Brand, Paul Klint, J.J. Vinju. Term Rewriting with Type-safe Traversal Functions. 2nd International Workshop on Reduction Strategies in Rewriting and Programming - WRS 2002, Jul 2002, Copenhagen, Denmark, 18 p. ⟨inria-00101030⟩
85 View
0 Download


Gmail Facebook Twitter LinkedIn More