![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
BibTeX record conf/tapsoft/KapurNS85
@inproceedings{DBLP:conf/tapsoft/KapurNS85, author = {Deepak Kapur and Paliath Narendran and G. Sivakumar}, editor = {Hartmut Ehrig and Christiane Floyd and Maurice Nivat and James W. Thatcher}, title = {A Path Ordering for Proving Termination of Term Rewriting Systems}, booktitle = {Mathematical Foundations of Software Development, Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT), Berlin, Germany, March 25-29, 1985, Volume 1: Colloquium on Trees in Algebra and Programming (CAAP'85)}, series = {Lecture Notes in Computer Science}, volume = {185}, pages = {173--187}, publisher = {Springer}, year = {1985}, url = {https://doi.org/10.1007/3-540-15198-2\_11}, doi = {10.1007/3-540-15198-2\_11}, timestamp = {Tue, 14 May 2019 10:00:50 +0200}, biburl = {https://dblp.org/rec/conf/tapsoft/KapurNS85.bib}, bibsource = {dblp computer science bibliography, https://dblp.org} }
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.