Subject
General Computer Science,Theoretical Computer Science
Reference12 articles.
1. A needed narrowing strategy;Antoy,1994
2. Theorem proving modulo;Dowek;Technical Report 3400, INRIA,1998
3. Modular termination of term rewriting systems revisited;Fernandez,1995
4. Proofs and Types;Girard,1989
5. J.-P. Jouannaud and Hélène Kirchner. Completion of a set of rules modulo a set of equations. In Proceedings 11th ACM Symposium on Principles of Programming Languages, Salt Lake City, 1984.
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献