Conditional Rewrite Systems

  • Enno Ohlebusch


Conditional term rewriting systems naturally come into play in the algebraic specification of abstract data types. The specification by positive conditional equations is not only more natural but also more expressive; see [BM84, BN98]. Papers like Kaplan [Kap84] and Bergstra and Klop [BK86] are mainly motivated by this point of view. Now, conditional term rewriting plays a fundamental role in the integration of functional and logic programming; see Hanus [Han94] for an overview of this field. Moreover, it should not be forgotten that conditional systems have been used as a proof-theoretic tool for establishing properties of unconditional term rewriting systems as well as λ-calculus extensions; for an overview, see Klop and de Vrijer [KV90].


Normal Form Inductive Hypothesis Reduction Step Effective Termination Critical Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 2002

Authors and Affiliations

  • Enno Ohlebusch
    • 1
  1. 1.Research Group in Practical Computer Science, Faculty of TechnologyUniversity of BielefeldBielefeldGermany

Personalised recommendations