Skip to main content
Article thumbnail
Location of Repository

A Conservative Look at Term Deduction Systems with Variable Binding

By W.J. Fokkink and C. Verhoef


We set up a formal framework to describe term deduction systems, such as transition system specifications in the style of Plotkin, and conditional term rewriting\ud systems. This framework has the power to express many-sortedness, general binding mechanisms and substitutions, among other notions such as negative premises\ud and unary predicates on terms.\ud The framework is used to present a conservativity format in operational semantics, which states sufficient criteria to ensure that the extension of a transition\ud system specification with new rules does not affect the behaviour of the original\ud terms.\ud Furthermore, we show how general theorems in structured operational semantics can be transformed into results in conditional term rewriting. We apply this\ud approach to the conservativity theorem, which yields a result that is useful in the\ud field of abstract data types

Topics: Wijsbegeerte
Year: 1995
OAI identifier:
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.