Author:
Bonfante Guillaume,Moser Georg
Publisher
Springer Berlin Heidelberg
Reference18 articles.
1. Lecture Notes in Computer Science;M. Avanzini,2008
2. Lecture Notes in Computer Science;M. Avanzini,2009
3. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
4. Bonfante, G., Cichon, A., Marion, J.Y., Touzet, H.: Algorithms with polynomial interpretation termination proof. JFP 11(1), 33–53 (2001)
5. Lecture Notes in Computer Science;G. Bonfante,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Polynomial Path Orders;Logical Methods in Computer Science;2013-11-01