Persistent constraints in constraint handling rules
- 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.
Download full text files
SHA-1:adb9831543f88f62422da7e53079c3bb24c6d2d2
Additional Services
| Author details: | Hariolf Betz, Frank Raiser, Thom Frühwirth |
|---|---|
| URN: | urn:nbn:de:kobv:517-opus-41547 |
| Publication type: | Conference Proceeding |
| Language: | English |
| Publication year: | 2010 |
| Publishing institution: | Universität Potsdam |
| Contributing corporation: | Gesellschaft für Logische Programmierung e.V. |
| Release date: | 2010/03/04 |
| Source: | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 155 - 166 |
| Organizational units: | Extern / Extern |
| DDC classification: | 0 Informatik, Informationswissenschaft, allgemeine Werke / 00 Informatik, Wissen, Systeme / 004 Datenverarbeitung; Informatik |
| Collection(s): | Universität Potsdam / Tagungsbände/Proceedings (nicht fortlaufend) / Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Constraint Handling Rules |
| License (German): |  Keine öffentliche Lizenz: Unter Urheberrechtsschutz |
