On proving confluence modulo equivalence for Constraint Handling Rules
From MaRDI portal
Publication:511019
DOI10.1007/s00165-016-0396-9zbMath1355.68050arXiv1611.03628OpenAlexW3099526688WikidataQ125525925 ScholiaQ125525925MaRDI QIDQ511019
Henning Christiansen, Maja H. Kirkeby
Publication date: 14 February 2017
Published in: Formal Aspects of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.03628
Theory of programming languages (68N15) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Constraint Handling Rules. Current research topics
- Higher-order rewrite systems and their confluence
- Confluence and semantics of constraint simplification rules
- A declarative approach for first-order built-in's of Prolog
- Confluence in concurrent constraint programming
- On theories with a combinatorial definition of 'equivalence'
- Confluence Modulo Equivalence in Constraint Handling Rules
- As time goes by: Constraint Handling Rules
- A complete and terminating execution model for Constraint Handling Rules
- Observable Confluence for Constraint Handling Rules
- Constraint Handling Rules
- Worst-case Analysis of Set Union Algorithms
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
- Testing for the Church-Rosser Property
- Biological Sequence Analysis
- Theory and practice of constraint handling rules
- Term Rewriting and All That
- Uniform confluence in concurrent computation
- Diagrammatic confluence for Constraint Handling Rules
- A confluent relational calculus for higher-order programming with constraints
- Logic Programming
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- CHR grammars
- Logic Based Program Synthesis and Transformation
