Hierachical Termination

@inproceedings{Dershowitz1994HierachicalT,
  title={Hierachical Termination},
  author={Nachum Dershowitz},
  booktitle={CTRS},
  year={1994}
}
From a practical perspective, it is important for programs to have modular correctness properties. Some (largely syntactic) sufficient conditions are given here for the union of terminating rewrite systems to be terminating, particularly in the hierarchical case, when one of the systems makes no reference to functions defined by the other. 1 I n t r o d u c t i o n A rewrite rule is an equation between first-order terms used to replace equals-byequals in one direction only. A rewrite system… CONTINUE READING