[Back]

K. Gmeiner:
"Transformation of Conditional Term Rewriting Systems";
Supervisor: B. Gramlich; Institut für Computersprachen / AB Theoretische Informatik und Logik, 2007; final examination: 2007-03-13.

Term rewriting serves as a simple and powerful framework in many areas of theoretical computer science like equational reasoning, deductive programming or computational logic. Unconditional term rewriting systems have been extensively studied in the past decades.
Conditional term rewriting provides a more compact way to define functions and is an intuitive approach to introduce conditions to rule--based equational reasoning. Furthermore, the operational semantics of functional--logic programming languages is based on conditional narrowing.
Conditional term rewriting systems are more difficult to analyze and many notions change their intuitive meaning. As a consequence, there has been a growing effort to develop transformations of conditional term rewriting systems to unconditional ones to adapt properties of unconditional systems to conditional systems.
This thesis gives an overview of how such transformations work in general, presents and compares existing approaches and develops some improvements.

Transforming conditional rewrite systems, eliminating conditions, soundness, completeness.