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.
| Identifer | oai:union.ndltd.org:Potsdam/oai:kobv.de-opus-ubp:4154 |
| Date | January 2010 |
| Creators | Betz, Hariolf, Raiser, Frank, Frühwirth, Thom |
| Contributors | Gesellschaft für Logische Programmierung e.V. |
| Publisher | Universität Potsdam, Extern. Extern |
| Source Sets | Potsdam University |
| Language | English |
| Detected Language | English |
| Type | InProceedings |
| Format | application/pdf |
| Source | Proceedings of the 23rd Workshop on (Constraint) Logic Programming 2009 / Geske, Ulrich; Wolf, Armin (Hrsg.). - Potsdam : Universitätsverlag, 2010. - S. 155 - 166 |
| Rights | http://opus.kobv.de/ubp/doku/urheberrecht.php |
Page generated in 0.0024 seconds