Name
Abstract | ||
|---|---|---|
Constraint Handling Rules (CHR) is a high-level language commonly used to write constraint solvers. Most CHR programs depend on the rened operational semantics, obfuscating their logical reading and causing dieren t (termination) behavior under the theoretical op- erational semantics. We introduce a source to source transformation called guard simplic ation which allows CHR programmers to write self- documented rules with a clear logical reading. Performance is improved by removing guards entailed by the implicit \no earlier (sub)rule red" precondition and optional type and mode declarations. A formal descrip- tion of the transformation is given, its implementation in the K.U.Leuven CHR compiler is presented and experimental results are discussed. |
Year | Venue | Keywords |
|---|---|---|
2005 | WCLP | program analysis.,: constraint handling rules,program trans- formation,optimized compilation,optimizing compiler,high level language,operational semantics,program analysis |
Field | DocType | Citations |
Programming language,Computer science,Guard (information security) | Conference | 3 |
PageRank | References | Authors |
0.69 | 4 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| jon sneyers | 1 | 117 | 9.47 |
| tom schrijvers | 2 | 652 | 63.35 |
| bart demoen | 3 | 956 | 77.58 |