HAL中约束处理规则的优化编译
Optimizing compilation of constraint handling rules in HAL
摘要：
本文讨论了约束处理规则的优化编译问题。CHR是一种多头承诺选择约束语言，通常用于编写增量约束求解器。CHR通常作为编译为底层语言的语言扩展来实现。在本文中，我们将展示如何使用不同种类的信息在编译的CHR，以获得访问效率，以及更好的翻译的CHR规则到底层语言，在这种情况下是HAL。所使用的信息种类包括类型、模式、确定性、函数依赖性和约束的对称性。我们还展示了如何分析可重构程序，以确定这些信息的功能依赖关系，对称性和其他种类的信息支持优化。
英文摘要：
In this paper we discuss the optimizing compilation of Constraint Handling Rules (CHRs). CHRs are a multi-headed committed choice constraint language, commonly applied for writing incremental constraint solvers. CHRs are usually implemented as a language extension that compiles to the underlying language. In this paper we show how we can use different kinds of information in the compilation of CHRs in order to obtain access efficiency, and a better translation of the CHR rules into the underlying language, which in this case is HAL. The kinds of information used include the types, modes, determinism, functional dependencies and symmetries of the CHR constraints. We also show how to analyze CHR programs to determine this information about functional dependencies, symmetries and other kinds of information supporting optimizations.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
