Completeness of Hierarchical Combinations of term Rewriting Systems

@inproceedings{Rao1993CompletenessOH,
  title={Completeness of Hierarchical Combinations of term Rewriting Systems},
  author={M. R. K. Krishna Rao},
  booktitle={FSTTCS},
  year={1993}
}
In this paper, we propose a sufficient condition for modularity of completeness of hierarchical combinations. The sufficient condition is a syntactic one (about recursion) based on constructor discipline. Our result generalizes Middeldorp and Toyama's result on modularity of completeness for shared constructor systems.