Sciweavers

376 search results - page 1 / 76
» Optimizing Pattern Matching Compilation by Program Transform...
Sort
View
ECEASST
2006
96views more  ECEASST 2006»
13 years 5 months ago
Optimizing Pattern Matching Compilation by Program Transformation
Motivated by the promotion of rewriting techniques and their use in major industrial applications, we have designed Tom: a pattern matching layer on top of conventional programming...
Emilie Balland, Pierre-Etienne Moreau
CC
2003
Springer
103views System Software» more  CC 2003»
13 years 10 months ago
A Pattern Matching Compiler for Multiple Target Languages
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations...
Pierre-Etienne Moreau, Christophe Ringeissen, Mari...
PLILP
1998
Springer
13 years 9 months ago
A Compiler for Rewrite Programs in Associative-Commutative Theories
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...
Pierre-Etienne Moreau, Hélène Kirchn...
ML
2008
ACM
135views Machine Learning» more  ML 2008»
13 years 4 months ago
Compiling pattern matching to good decision trees
We address the issue of compiling ML pattern matching to compact and efficient decisions trees. Traditionally, compilation to decision trees is optimized by (1) implementing decis...
Luc Maranget
CC
2001
Springer
177views System Software» more  CC 2001»
13 years 9 months ago
Imperative Program Transformation by Rewriting
Abstract. We present a method of specifying standard imperative program optimisations as a rewrite system. To achieve this we have extended the idea of matching sub-terms in expres...
David Lacey, Oege de Moor