Building program optimizers with rewriting strategies
ICFP '98 Proceedings of the third ACM SIGPLAN international conference on Functional programming
Software—Practice & Experience
The ASF+SDF Meta-environment: A Component-Based Language Development Environment
CC '01 Proceedings of the 10th International Conference on Compiler Construction
Journal of Functional Programming
XSLT 2.0 and XPath 2.0 Programmer's Reference (Programmer to Programmer)
XSLT 2.0 and XPath 2.0 Programmer's Reference (Programmer to Programmer)
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
ESOP'07 Proceedings of the 16th European conference on Programming
A pattern matching compiler for multiple target languages
CC'03 Proceedings of the 12th international conference on Compiler construction
AMAST'06 Proceedings of the 11th international conference on Algebraic Methodology and Software Technology
Dynamic adaptation through event reconfiguration
OTM'11 Proceedings of the 2011th Confederated international conference on On the move to meaningful internet systems
| Hi-index | 0.00 |
We present the Tom language that extends Java with the purpose of providing high level constructs inspired by the rewriting community. Tom bridges thus the gap between a general purpose language and high level specifications based on rewriting. This approach was motivated by the promotion of rule based techniques and their integration in large scale applications. Powerful matching capabilities along with a rich strategy language are among Tom 's strong features that make it easy to use and competitive with respect to other rule based languages. Tom is thus a natural choice for querying and transforming structured data and in particular XML documents [1]. We present here its main XML oriented features and illustrate its use on several examples.