Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

Details Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction

2010-09-15

arxiv.org/abs/1009.2900v1

Computer Science

Programming Languages

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Linear-Logic Based Analysis of Constraint Handling Rules with Disjunction will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-77263