HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

Term Rewriting with Type-safe Traversal Functions

Mark G. J. van den Brand 1 Paul Klint J.J. Vinju
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
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. 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.
Document type :
Conference papers
Complete list of metadata

Contributor : Publications Loria Connect in order to contact the contributor
Submitted on : Tuesday, September 26, 2006 - 2:53:57 PM
Last modification on : Friday, February 4, 2022 - 3:21:58 AM


  • 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⟩



Record views