Rewriting Strategies in Java

Emilie Balland 1 Pierre-Etienne Moreau 1 Antoine Reilles 1
1 PROTHEO - Constraints, automatic deduction and software properties proofs
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
Abstract : In any language designed to express transformations, the notion of rewrite rule is a key feature. Its conciseness as well as its strong theoretical foundations are essential. The notion of strategy is complementary: this describes how rules are applied. In this paper, we show how a high-level strategy language can be implemented in a Java setting. We present the integration of the visitor combinator design pattern into Tom. This corresponds to an interpreter for strategy expressions. To be more efficient, we present a compilation method based on bytecode specialization. This low-level transformation is expressed in Tom itself, using rules and strategies.
Document type :
Conference papers
Complete list of metadatas

Cited literature [13 references]  Display  Hide  Download

https://hal.inria.fr/inria-00274919
Contributor : Emilie Balland <>
Submitted on : Monday, April 21, 2008 - 6:39:48 PM
Last modification on : Thursday, January 11, 2018 - 6:19:58 AM
Long-term archiving on : Friday, September 28, 2012 - 12:55:23 PM

File

final.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00274919, version 1

Collections

Citation

Emilie Balland, Pierre-Etienne Moreau, Antoine Reilles. Rewriting Strategies in Java. The Eighth International Workshop on Rule-Based Programming - RBP'07, Jun 2007, Paris, France. ⟨inria-00274919⟩

Share

Metrics

Record views

245

Files downloads

160