Skip to main content
Article thumbnail
Location of Repository

T.: Persistent Constraints in Constraint Handling Rules

By Hariolf Betz, Frank Raiser and Thom Frühwirth

Abstract

Abstract. In the most abstract definition of its operational semantics, the declarative and concurrent programming language CHR is trivially non-terminating for a significant class of programs. Common refinements of this definition, in closing the gap to real-world implementations, compromise on declarativity and/or concurrency. Building on recent work and the notion of persistent constraints, we introduce an operational semantics avoiding trivial non-termination without compromising on its essential features.

Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.184.9030
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://opus.kobv.de/ubp/vollte... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.