Inductive theorems for higher-order rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3091, Issue , 2004, Pages 269-284

  Aoto, Takahito ^a   Yamada, Toshiyuki ^b   Toyama, Yoshihito ^a  

^a TOHOKU UNIVERSITY   (Japan)

^b MIE UNIVERSITY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTERS;

FIRST-ORDER TERM REWRITING; HIGHER-ORDER; HIGHER-ORDER REWRITING; INDUCTIONLESS INDUCTION; INDUCTIVE REASONING; TERM REWRITING;

ARTIFICIAL INTELLIGENCE;

EID: 35048847596     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-25979-4_19     Document Type: Article

References (21)

1. T. Aoto and T. Yamada. Proving termination of simply typed term rewriting systems automatically. IPSJ Transactions on Programming, 44(SIG 4 PRO 17):67-77, 2003. In Japanese.
2. T. Aoto and T. Yamada. Termination of simply typed term rewriting systems by translation and labelling. In Proceedings of the 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, pages 380-394. Springer-Verlag, 2003.
3. T. Aoto, T. Yamada, and Y. Toyama. Proving inductive theorems of higher-order functional programs. In Information Technology Letters, volume 2, pages 21-22, 2003. In Japanese.
4. F. Baader and T. Nipkow. Term Rewriting and All That. Cambridge University Press, Cambridge, 1998.
5. G. Huet and J.-M. Hullot. Proof by induction in equational theories with constructors. Journal of Computer and System Sciences, 25(2):239-266, 1982.
6. J.-P. Jouannaud and M. Okada. Executable higher-order algebraic specification languages. In Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pages 350-361. IEEE Press, 1991.
7. D. Kapur, P. Narendran, and H. Zhang. On sufficient-completeness and related properties of term rewriting systems. Acta Informatica, 24(4):395-415, 1987.
8. D. Kapur, P. Narendran, and H. Zhang. Automating inductionless induction using test sets. Journal of Symbolic Computation, 11(1-2):81-111, 1991.
9. J. W. Klop. Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit, Utrecht, 1980.
10. H. Koike and Y. Toyama. Inductionless induction and rewriting induction. Comptuter Software, 17(6):1-12, 2000. In Japanese.
11. K. Kusakari. On proving termination of term rewriting systems with higher-order variables. IPSJ Transactions on Programming, 42(SIG 7 PRO 11):35-45, 2001.
12. K. Kusakari. Inductive theorems in SRS. Manuscript, 2003. In Japanese.
13. K. Kusakari, M. Sakai, and T. Sakabe. Characterizing inductive theorems by extensional initial models in a higher-order equational logic. Distributed at IPSJ seminar PRO-2003-3, 2003.
14. H. Linnestad, C. Prehofer, and O. Lysne. Higher-order proof by consistency. In Proceedings of the 16th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1180 of LNCS, pages 274-285. Springer-Verlag, 1996.
15. R. Mayr and T. Nipkow. Higher-order rewrite systems and their confluence. Theoretical Computer Science, 192(1):3-29, 1998.
16. K. Meinke. Higher-order equational logic for specification, simulation and testing. In Proceedings of the 2nd International Workshp on Higher-Order Algebra, Logic and Term Rewriting, volume 1074 of LNCS, pages 124-143. Springer-Verlag, 1995.
17. D. R. Musser. On proving inductive properties of abstract data types. In Proceedings of the 7th Annual ACM Symposium on Principles of Programming Languages, pages 154-162. ACM Press, 1980.
18. T. Nipkow and G. Weikum. A decidability result about sufficient- completeness of axiomatically specified abstract data types. In Proceedings of the 6th GI-Conference on Theoretical Computer Science, volume 145 of LNCS, pages 257-267. Springer-Verlag, 1983.
19. Terese. Term Rewriting Systems. Cambridge University Press, 2003.
20. Y. Toyama. How to prove equivalence of term rewriting systems without induction. Theoretical Computer Science, 90(2):369-390, 1991.
21. T. Yamada. Confluence and termination of simply typed term rewriting systems. In Proceedings of the 12th International Conference on Rewriting Techniques and Applications, volume 2051 of LNCS, pages 338-352. Springer-Verlag, 2001.