On dependency pair method for proving termination of higher-order rewrite systems

IEICE Transactions on Information and Systems

Volumn E88-D, Issue 3, 2005, Pages 583-593

  Sakai, Masahiko ^a   Kusakari, Keiichirou ^a  

^a NAGOYA UNIVERSITY   (Japan)

Author keywords

Dependency forest; Dependency pair; Higher order rewrite system; Termination

Indexed keywords

LINEAR SYSTEMS; TECHNICAL WRITING;

DEPENDENCY FOREST; DEPENDENCY PAIR; HIGHER-ORDER REWRITE SYSTEM; TERMINATION;

SYSTEMS ANALYSIS;

EID: 24144467869     PISSN: 09168532     EISSN: None     Source Type: Journal    
DOI: 10.1093/ietisy/e88-d.3.583     Document Type: Article

References (22)

1. P.B. Andrews, "Resolution in type theory," J. Symbolic Logic, vol.36, no.3, pp.414-432, 1991.
2. T. Arts and J. Giesl, "Automatically proving termination where simplification orderings fail," Proc. 22nd International Colloquium on Trees in Algebra and Programming, CAAP'97, in LNCS, vol.1214, pp.261-272, Springer-Verlag, 1997.
3. T. Arts, Automatically proving termination and innermost normalization of term rewriting system, Ph.D. Thesis, Utrecht University, The Netherlands, 1997.
4. T. Arts and J. Giesl, "Termination of term rewriting using dependency pairs," Theor. Comput. Sci., vol.236, pp.133-178, 2000.
5. H. Barendregt, "Lambda calculi with types," in Handbook of Logic in Computer Science, vol.2, ed. S. Abramsky, D.M. Gabbay, and T.S.E. Maibaum, pp.118-413, Oxford University Press, 1993.
6. F. Baader and T. Nipkow, Term rewriting and all that, Cambridge University Press, 1998.
7. J.-Y. Girard, Interprétation fonctionnelle et élimination des coupures del'arithmétique d'ordre supérieur, Ph.D. Thesis, University of Paris VII, 1972.
8. G. Huet and J.-J. Lévy, "Computations in orthogonal rewriting systems, I and II," in Computational Logic, Essays in Honor of Alan Robinson, pp.396-443, The MIT Press, 1991.
9. M. Iwami, M. Sakai, and Y. Toyama, "An improved recursive decomposition ordering for higher-order rewrite systems," IEICE Trans. Inf. & Syst., vol.E81-D, no.9, pp.988-996, Sept. 1998.
10. M. Iwami and Y. Toyama, "Simplification ordering for higher-order rewrite systems," IPSJ Trans. Programming, vol.40, no.SIG 4 (PRO 3), pp. 1-10, 1999.
11. J.-P. Jouannaud and A. Rubio, "Rewrite orderings for higher-order terms in η-long β-normal form and the recursive path ordering," Theor. Comput. Sci., vol.208, pp.33-58, 1998.
12. J.-P. Jouannaud, A. Rubio, "The higher-order recursive path ordering," Proc. IEEE Symposium on Logic in Computer Science, pp.402-411, Trento, Italy, 1999.
13. H. Kasuya, M. Sakai, and K. Agusa, "Descendants and head normalization of higher-order rewrite systems," 6th International Symposium on Functional and Logic Programming, FLOPS2002, in LNCS 2441, pp.198-211, 2002.
14. K. Kusakari, "On proving termination of term rewriting systems with higher-order variables," IPSJ Trans. Programming, vol.42, no.SIG 7 (PRO 11), pp.35-45, 2001.
15. K. Kusakari, "Higher-order path orders based on computability," IEICE Trans. Inf. & Syst., vol.E87-D, no.2, pp.352-359, Feb. 2004.
16. D. Miller, "A logic programming language with lambda-abstraction, function variables, and simple unification," J. Logic Comput., vol.1, no.4, pp.497-536, 1991.
17. O. Lysne and J. Pins, "A termination ordering for higher order rewrite systems," Proc. 6th International Conference on Rewriting Techniques and Applications, RTA'95, in LNCS, vol.914, pp.26-40, 1995.
18. C. Loría-Sáenz and J. Steinbach, "Termination of combined (rewrite and λ-calculus) systems," Proc. 3rd International Workshop on Conditional Term Rewriting Systems, CTRS'92, in LNCS, vol.656, pp.143-147, 1993.
19. T. Nipkow, "Higher-order critical pairs," Proc. 6th annual IEEE Symposium on Logic in Computer Science, pp.342-349, 1991.
20. F. Raamsdonk, "On termination of higher-order rewriting," Proc. 12th Int. Conf. on Rewriting Techniques and Applications, in LNCS, vol.2051, pp.261-275, 2001.
21. M. Sakai, Y. Watanabe, and T. Sakabe, "An extension of dependency pair method for proving termination of higher-order rewrite systems," IEICE Trans. Inf. & Syst., vol.E84-D, no.8, pp.1025-1032, Aug. 2001.
22. W.W. Tait, "Intensional interpretation of functionals of finite type," J. Symbolic Logic, vol.32, pp. 198-212, 1967.