A Unified Analytical Foundation for Constraint Handling Rules

Front Cover
BoD – Books on Demand, Dec 23, 2014 - Computers - 180 pages
0 Reviews
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.
 

What people are saying - Write a review

We haven't found any reviews in the usual places.

Contents

intuitionistic linear logic
14
equivalence and the operational semantics
47
a linearlogic semantics for constraint handling rules
93
linearlogic reasoning over constraint handling rules
109
Proofs for Chapter 4
150
Index
175
Copyright

Other editions - View all

Common terms and phrases

About the author (2014)

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.

The editor Thom Fruehwirth is a professor of Computer Science at the University of Ulm, Germany. He is the designer of the popular programming language Constraint Handling Rules (CHR) and author of the book by the same name. He has also co-authored two leading textbooks on constraint programming and reasoning.

The editor Uwe Schöning is a professor of Theoretical Computer Science at the University of Ulm, Germany. He introduced the low and high hierarchies to structural complexity theory to describe the internal structure of the complexity class NP. Later, he invented a much-cited SAT-Algorithm. He has also authored several popular textbooks on Logic in Computer Science.

Bibliographic information