Beschreibung
The non-deterministic rule-based programming language of Constraint Handling Rules (CHR) features a remarkable combination of desirable properties: a foundation in classical logic, powerful analysis methods for deciding program properties - especially confluence - and an efficient execution model. Upon a closer look, we observe several limitations to this asset. In this thesis, we introduce several concepts to amend for these short- comings. Firstly, we propose an unusually concise formulation of the two most important semantic interpretations of CHR. Secondly, we analyse the relationship between the major diverging interpretations of CHR. Finally, we found CHR on intuitionistic linear logic.
Autorenporträt
Hariolf Betz studied Computer Science and Philosophy at the University of Ulm. Early on, he developed a keen interest in the logical foundations of programming. He was granted a state-funded scholarship to pursue his PhD. He currently works as a software engineer and IT consultant. His professional interests include mathematical modelling, distributed software architecture, natural user interfaces and real-life applications of constraint programming.
Herstellerkennzeichnung:
BoD - Books on Demand
In de Tarpen 42
22848 Norderstedt
DE
E-Mail: info@bod.de
