Author:
Kop Cynthia,Raamsdonk Femke
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference38 articles.
1. T. Aoto and Y. Yamada. Dependency pairs for simply typed term rewriting. In J. Giesl, editor,Proceedings of RTA 2005, volume 3467 ofLNCS, pages 120-134, Nara, Japan, 2005. Springer.
2. Termination of term rewriting using dependency pairs
3. F. Blanqui, J.-P. Jouannaud, and A. Rubio. The computability path ordering: The end of a quest. InCSL 2008, volume 5213 ofLNCS, pages 1-14, Bertinoro, Italy, 2008. Springer.
4. H.J.S. Bruggink.Equivalence of Reductions in Higher-Order Rewriting. PhD thesis, Utrecht University, 2008.
5. Combinatory weak reduction in lambda calculus
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献