Author:
Aoto Takahito,Yamada Toshiyuki,Toyama Yoshihito
Publisher
Springer Berlin Heidelberg
Reference21 articles.
1. Aoto, T., Yamada, T.: Proving termination of simply typed term rewriting systems automatically. IPSJ Transactions on Programming 44(SIG 4 PRO 17), 67–77 (2003) (in Japanese)
2. Lecture Notes in Computer Science;T. Aoto,2003
3. Aoto, T., Yamada, T., Toyama, Y.: Proving inductive theorems of higher-order functional programs. Information Technology Letters 2, 21–22 (2003) (in Japanese)
4. Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge University Press, Cambridge (1998)
5. Huet, G., Hullot, J.-M.: Proof by induction in equational theories with constructors. Journal of Computer and System Sciences 25(2), 239–266 (1982)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献