Primitive inductive theorems bridge implicit induction methods and inductive theorems in higher-order rewriting

IEICE Transactions on Information and Systems

Volumn E88-D, Issue 12, 2005, Pages 2715-2726

  Kusakari, Keiichirou ^a,b,c   Sakai, Masahiko ^a,c   Sakabe, Toshiki ^a,b,c,d  

^a NAGOYA UNIVERSITY   (Japan)

^b IPSJ   (Japan)

^c JSSST   (Japan)

^d Nagoya University ^*

Author keywords

Algebraic specification; Implicit induction method; Inductive theorem; Primitive inductive theorem; Simply typed term rewriting system

Indexed keywords

LINEAR ALGEBRA; NUMERICAL METHODS;

ALGEBRAIC SPECIFICATION; IMPLICIT INDUCTION METHOD; PRIMITIVE INDUCTIVE THEOREM; SIMPLY-TYPED TERM REWRITING SYSTEM;

THEOREM PROVING;

EID: 30344474000     PISSN: 09168532     EISSN: 17451361     Source Type: Journal    
DOI: 10.1093/ietisy/e88-d.12.2715     Document Type: Conference Paper

References (24)

1. T. Aoto, T. Yamada, and Y. Toyama, "Proving inductive theorems of higher-order functional programs," Proc. Forum on Information Technology 2003 (FIT2003), Information Technology Letters, vol.2, pp.21-22, 2003.
2. T. Aoto, T. Yamada, and Y. Toyama, "Inductive theorems for higher-order rewriting," Proc. 15th Int. Conf. on Rewriting Techniques and Applications (RTA 2004), LNCS 3091, pp.269-284, 2004.
3. T. Nipkow, "Higher-order critical pairs," Proc. 6th IEEE Symp. Logic in Computer Science, pp.342-349, IEEE Computer Society Press, 1991.
4. F. Baader and T. Nipkow, Term Rewriting and All That, Cambridge University Press, 1998.
5. G. Birkhoff, "On the structure of abstract algebras," Proc. Cambridge Philosophical Society, vol.31, pp.433-454, 1935.
6. A. Bouhoula, Automated Theorem Proving by Test Set Induction, J. Symbolic Computation, vol.23, pp.47-77, 1997.
7. R.S. Boyer and J.S. Moore, A Computational Logic, Academic Press, NewYork, 1979.
8. R. Diaconescu and K. Futatsugi, CafeOBJ Report, AMAST Series in Computing 6, World Scientific, 1998.
9. J.A. Goguen, T. Winkler, J. Meseguer, K. Futatsugi, and J.P. Jouannaud, "Introducing OBJ," in Software Engineering with OBJ: Algebraic specification in action, ed. Goguen and Malcolm, Kluwer, 2000.
10. J. Goguen, Theorem Proving and Algebra, MIT Press, to appear.
11. G. Huet and J.M. Hullot, "Roof by induction in equational theories with constructors," J. Comput. Syst. Sci., vol.25, pp.239-266, 1982.
12. Y. Inagaki and T. Sakabe, "Fundamentals of algebraic specification of abstract data types (1): Many sorted algebras and equational logic," Inf. Process., vol.25, no.1, pp.47-53, 1984.
13. Y. Inagaki and T. Sakabe, "Fundamentals of algebraic specification of abstract data types (2): Abstract data types," Inf. Process., vol.25, no.5, pp.491-501, 1984.
14. Y. Inagaki and T. Sakabe, "Fundamentals of algebraic specification of abstract data types (3): Models of abstract type constructors and initial algebra semantics," Inf. Process., vol.25, no.7, pp.708-716, 1984.
15. D. Kapur, P. Narendran, and H. Zhang, "Automating inductionless induction using test set," J. Symbolic Computation, vol.11, pp.83-111, 1991.
16. H. Koike and Y. Toyama, "Comparison between inductionless induction and rewriting induction," JSSST Computer Software, vol.17, no.6, pp.1-12, 2000.
17. K. Kusakari, "On proving termination of term rewriting systems with higher-order variables," Trans. IPSJ Programming, vol.42, no.SIG 7 (PRO 11), pp.35-45, 2001.
18. K. Kusakari, "Higher-order path orders based on computability, " IEICE Trans. Inf. & Syst., vol.E87-D, no.2, pp.352-359, Feb. 2004.
19. K. Meinke, "Proof theory of higher-order equations: Conservativity, normal forms and term rewriting," J. Comput. Syst. Sci., vol.67, pp.127-173, 2003.
20. B. Möller, A. Tarlecki, and M. Wirsing, "Algebraic specifications of reachable higher-order algebras," Proc. 5th Workshop on Specification of Abstract Data Types, LNCS 332, pp. 154-169, 1987.
21. D.R. Musser, "On proving induction properties of abstract data types," Proc. 7th ACM Symp. Principles of Programming Languages, pp.154-162, 1980.
22. U.S. Reddy, "Term rewriting induction," Proc. 10th International Conference on Automated Deduction, LNAI 449 (CADE 90), pp.162-177, 1990.
23. Y. Toyama, "How to prove equivalence of term rewriting systems without induction," Theor. Comput. Sci., vol.90, no.2, pp.369-390, 1991.
24. M. Wirsing, "Algebraic specification, formal models and semantics," vol.B of Handbook of Theoretical Computer Science, chapter 13, pp.676-788, Elsevier Science, 1990.