Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

2010/09/15 by Hariolf Betz, Betz, Hariolf, Thom Frühwirth +2
Computer Science · #Formal Methods in Verification #Logic, Reasoning, and Knowledge #Logic, programming, and type systems #cs.PL

paper · pdf · doi:10.48550/arxiv.1009.2900

arxiv created 2010/09/15 · arxiv updated 2010/09/16

Abstract

Constraint Handling Rules (CHR) is a declarative committed-choice programming language with a strong relationship to linear logic. Its generalization CHR with Disjunction (CHRv) is a multi-paradigm declarative programming language that allows the embedding of horn programs. We analyse the assets and the limitations of the classical declarative semantics of CHR before we motivate and develop a linear-logic declarative semantics for CHR and CHRv. We show how to apply the linear-logic semantics to decide program properties and to prove operational equivalence of CHRv programs across the boundaries of language paradigms.

Related

• Constraint Handling Rules - What Else?
• Constraint Handling Rules with Multiset Comprehension Patterns
• On the Expressive Power of Multiple Heads in CHR
• A compositional Semantics for CHR
• As time goes by: Constraint Handling Rules - A survey of CHR research from 1998 to 2007