基于多集合理解模式的约束处理规则
Constraint Handling Rules with Multiset Comprehension Patterns
摘要：
SQL是一种声明性、并发性和提交性的基于选择规则的约束程序设计语言。我们扩展了多集理解模式，为程序员提供了编写多集重写规则，可以匹配存储中的变量数量的约束的能力。这使得为协调大量数据或需要聚合操作的算法编写更具可读性、简洁性和声明性的代码成为可能。我们将此扩展称为$\mathit{CHR}^\mathit{cp}$。我们给出了$\mathit{CHR}^\mathit{cp}$的高级抽象语义，然后是低级操作语义。然后，我们将展示这个操作语义相对于抽象语义的合理性。
英文摘要：
CHR is a declarative, concurrent and committed choice rule-based constraint programming language. We extend CHR with multiset comprehension patterns, providing the programmer with the ability to write multiset rewriting rules that can match a variable number of constraints in the store. This enables writing more readable, concise and declarative code for algorithms that coordinate large amounts of data or require aggregate operations. We call this extension $\mathit{CHR}^\mathit{cp}$. We give a high-level abstract semantics of $\mathit{CHR}^\mathit{cp}$, followed by a lower-level operational semantics. We then show the soundness of this operational semantics with respect to the abstract semantics.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
