Author:
Kamareddine Fairouz,Monin François
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. T. Arts and J. Giesl. Automatically proving termination where simplification orderings fail in Proceeding TAPSOFT’97, LNCS, volume 1214, 261–272.
2. T. Arts and J. Giesl. Proving innermost normalisation automatically in Proceeding RTA’97, LNCS, volume 1232, 157–171.
3. A. Ben Cherifa and P. Lescanne. Termination of rewriting systems by polynomial interpretations and its implementation. Science of Computer Programming 9(2),137–159, 1987.
4. C. Cornes et al.. The Coq proof assistant reference manual version 5.10. Technical Report 077, INRIA, 1995.
5. N. Dershowitz. Termination of rewriting. Theoretical Computer Science 17, 279–301,1982.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献