Author:
Shiraishi Tomoki,Kikuchi Kentaro,Aoto Takahito
Publisher
Springer International Publishing
Reference15 articles.
1. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
2. Comon, H., Jacquemard, F.: Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1), 123–153 (2003)
3. Geser, A.: Relative termination. Ph.D. thesis, Universität Passau (1990). Available as technical report 91–03
4. Gnaedig, I., Kirchner, H.: Computing constructor forms with non terminating rewrite programs. In: Proceedings of the 8th PPDP, pp. 121–132. ACM (2006)
5. Gnaedig, I., Kirchner, H.: Proving weak properties of rewriting. Theoret. Comput. Sci. 412(34), 4405–4438 (2011)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献