Operational equivalence of CHR programs and constraints

DOI10.1007/978-3-540-48085-3_4MaRDI QIDQ4495104zbMATH OpenFDO

Authors Slim Abdennadher, Thom Frühwirth

Publication date 4 January 2001

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-48085-3_4

zbMATH Keywords

constraint handling rulesoperational equivalenceprogramming language semantics

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55)

Recommendations

• Confluence modulo equivalence in Constraint Handling Rules
• The refined operational semantics of constraint handling rules
• On proving confluence modulo equivalence for Constraint Handling Rules
• A compositional semantics for CHR
• Operational and semantic equivalence between recursive programs.

Cited in

(6)

• A Transformational Approach for Proving Properties of the CHR Constraint Store
• Guard Reasoning in the Refined Operational Semantics of CHR
• scientific article; zbMATH DE number 7047281 (Why is no real title available?)
• On proving confluence modulo equivalence for Constraint Handling Rules
• Strong Joinability Analysis for Graph Transformation Systems in CHR
• As time goes by. II: More automatic complexity analysis of concurrent rule programs

This page was built for publication: Operational equivalence of CHR programs and constraints

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4495104)