Sciweavers

17 search results - page 1 / 4
» Compiling Pattern Matching by Term Decomposition
Sort
View
LFP
1990
106views more  LFP 1990»
13 years 6 months ago
Compiling Pattern Matching by Term Decomposition
Laurence Puel, Ascánder Suárez
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
PPDP
2005
Springer
13 years 10 months ago
Formal validation of pattern matching code
When addressing the formal validation of generated software, two main alternatives consist either to prove the correctness of compilers or to directly validate the generated code....
Claude Kirchner, Pierre-Etienne Moreau, Antoine Re...
ISPD
2010
ACM
249views Hardware» more  ISPD 2010»
13 years 11 months ago
A matching based decomposer for double patterning lithography
Double Patterning Lithography (DPL) is one of the few hopeful candidate solutions for the lithography for CMOS process beyond 45nm. DPL assigns the patterns less than a certain di...
Yue Xu, Chris Chu
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...