Guard and Continuation Optimization for Occurrence Representations of CHR
Guard and Continuation Optimization for Occurrence Representations of CHR
复制标题
CHR 出现表示的保护和延拓优化
DOI：
--
复制
发表时间：
2005
期刊：
影响因子：
--
通讯作者：
Bart Demoen
中科院分区：
文献类型：
--
作者：
Jon Sneyers;Tom Schrijvers;Bart Demoen
约束处理规则 (CHR) 是一种基于规则的高级语言扩展，通常嵌入在 Prolog 中。我们引入了 CHR 程序的新出现表示，以及出现表示的新操作语义，相当于广泛实现的细化操作语义。出现表示允许以自然的方式表达保护和延续优化，这消除了冗余保护并消除了所包含出现的冗余代码。这些优化使 CHR 程序员能够以清晰的逻辑阅读方式编写自记录规则。我们展示了两种优化的正确性，提出了 K.U.Leuven CHR 编译器中的实现，并讨论了加速测量。
Constraint Handling Rules (CHR) is a high-level rule-based language extension, commonly embedded in Prolog. We introduce a new occurrence representation of CHR programs, and a new operational semantics for occurrence representations, equivalent to the widely implemented refined operational semantics. The occurrence representation allows in a natural way to express guard and continuation optimizations, which remove redundant guards and eliminate redundant code for subsumed occurrences. These optimizations allow CHR programmers to write self-documented rules with a clear logical reading. We show correctness of both optimizations, present an implementation in the K.U.Leuven CHR compiler, and discuss speedup measurements.