Publisher
Springer Berlin Heidelberg
Reference25 articles.
1. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail. In M. Bidoit and M. Dauchet, editors, Proc. 22nd CAAP Conf., Lille (France), volume 1214 of LNCS, pages 261–272. Springer-Verlag, 1997.
2. T. Arts and J. Giesl. Proving innermost termination automatically. In Proc. 7th RTA Conf., Sitges (Spain), volume 1232 of LNCS, pages 157–171. Springer-Verlag, 1997.
3. H. Comon. Sufficient completeness, term rewriting system and anti-unification. In J. Siekmann, editor, Proc. 8th CADE Conf., Oxford (UK), volume 230 of LNCS, pages 128–140. Springer-Verlag, 1986.
4. H. Comon, M. Dauchet, R. Gilleron, D. Lugiez, S. Tison, and Tommasi. Tree automata techniques and applications. Preliminary Version, http://13ux02.univ-lille3.fr/tata/, 1997.
5. H. Comon and J.-L. Rémy. How to characterize the language of ground normal forms. Technical Report 676, INRIA-Lorraine, 1987.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献