Author:
Nishida Naoki,Sakai Masahiko,Sakabe Toshiki
Publisher
Centre pour la Communication Scientifique Directe (CCSD)
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. S. Antoy, B. Brassel, and M. Hanus. Conditional narrowing without conditions. InProceedings of the 5th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, pages 20-31, ACM Press, 2003.
2. J. Avenhaus and C. Loría-Sáenz. On conditional rewrite systems with extra variables and deterministic logic programs. InProceedings of the 5th International Conference on Logic Programming and Automated Reasoning, volume 822 ofLecture Notes in Computer Science, pages 215-229, Springer, 1994.
3. F. Baader and T. Nipkow.Term Rewriting and All That. Cambridge University Press, United Kingdom, 1998.
4. Conditional rewrite rules: Confluence and termination
5. H. Comon, M. Dauchet, R. Gilleron, F. Jacquemard, D. Lugiez, C. Löding, S. Tison, and M. Tommasi. Tree automata techniques and applications. Available on: http://www.grappa.univ-lille3.fr/tata, 2007. Release October 12th, 2007.
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献