On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems

Enno Ohlebusch. On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems. In Aart Middeldorp, Taisuke Sato, editors, Functional and Logic Programming, 4th Fuji International Symposium, FLOPS 99, Tsukuba, Japan, November 11-13, 1999, Proceedings. Volume 1722 of Lecture Notes in Computer Science, pages 179-193, Springer, 1999.

@inproceedings{Ohlebusch99,
  title = {On Quasi-Reductive and Quasi-Simplifying Deterministic Conditional Rewrite Systems},
  author = {Enno Ohlebusch},
  year = {1999},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Ohlebusch99},
  cites = {0},
  citedby = {0},
  pages = {179-193},
  booktitle = {Functional and Logic Programming, 4th Fuji International Symposium, FLOPS 99, Tsukuba, Japan, November 11-13, 1999, Proceedings},
  editor = {Aart Middeldorp and Taisuke Sato},
  volume = {1722},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-66677-X},
}