Author:
Fernández Maribel,Rubio Albert
Publisher
Springer Berlin Heidelberg
Reference32 articles.
1. Arts, T., Giesl, J.: Termination of Term Rewriting Using Dependency Pairs. Theoretical Computer Science 236, 133–178 (2000)
2. Baader, F., Nipkow, T.: Term rewriting and all that. Cambridge University Press, Great Britain (1998)
3. Bachmair, L., Dershowitz, N., Hsiang, J.: Orderings for equational proofs. In: Proc. Symp. Logic in Computer Science, Boston, pp. 346–357 (1986)
4. Lecture Notes in Computer Science;F. Blanqui,2000
5. Rewriting Techniques;L. Bachmair,1989
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rewriting with generalized nominal unification;Mathematical Structures in Computer Science;2020-05-22
2. Completeness in PVS of a Nominal Unification Algorithm;Electronic Notes in Theoretical Computer Science;2016-07
3. Checking Overlaps of Nominal Rewriting Rules;Electronic Notes in Theoretical Computer Science;2016-07
4. Nominal Confluence Tool;Automated Reasoning;2016
5. From nominal to higher-order rewriting and back again;Logical Methods in Computer Science;2015-12-14