Dependency Pairs for Simply Typed Term Rewriting

Takahito Aoto, Toshiyuki Yamada. Dependency Pairs for Simply Typed Term Rewriting. In Jürgen Giesl, editor, Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings. Volume 3467 of Lecture Notes in Computer Science, pages 120-134, Springer, 2005. [doi]

@inproceedings{AotoY05,
  title = {Dependency Pairs for Simply Typed Term Rewriting},
  author = {Takahito Aoto and Toshiyuki Yamada},
  year = {2005},
  url = {http://springerlink.metapress.com/openurl.asp?genre=article&issn=0302-9743&volume=3467&spage=120},
  tags = {term rewriting, graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/AotoY05},
  cites = {0},
  citedby = {0},
  pages = {120-134},
  booktitle = {Term Rewriting and Applications, 16th International Conference, RTA 2005, Nara, Japan, April 19-21, 2005, Proceedings},
  editor = {Jürgen Giesl},
  volume = {3467},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-25596-6},
}