Higher-order termination: From kruskal to computability

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

Volumn 4246 LNAI, Issue , 2006, Pages 1-14

  Blanqui, Frédéric ^a   Jouannaud, Jean Pierre ^b,d   Rubio, Albert ^c  

^a LORIA   (France)

^b ECOLE POLYTECHNIQUE   (France)

^c UNIVERSITAT POLITÈCNICA DE CATALUNYA   (Spain)

^d UNIVERSITÉ PARIS SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33845188118     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11916277_1     Document Type: Conference Paper

References (26)

1. F. Barbanera. Adding algebraic rewriting to the calculus of constructions: Strong normalization preserved. In Proc. 2nd Int. Workshop on Conditional and Typed Rewriting Systems, Montreal, LNCS 516, 1990.
2. F. Barbanera, M. Fernández, and H. Geuvers. Modularity of strong normalization and confluence in the λ-algebraic-cube. In Proc. 9th IEEE Symp. Logic in Computer Science, pages 406-415, 1994.
3. F. Blanqui, J.-P. Jouannaud, and M. Okada. The Calculus of Algebraic Constructions. In Paliath Narendran and Michael Rusinowitch, editors, 10th International Conference on Rewriting Techniques and Applications, volume 1631 of Lecture Notes in Computer Science, Trento, Italy, July 1999. Springer Verlag.
4. F. Blanqui, J.-P. Jouannaud, and M. Okada. Inductive-Data-Type Systems. Theoretical Computer Science, 272(1-2):41-68, 2002.
5. F. Blanqui. Rewriting modulo in Deduction modulo. In Proc. of the 14th International Conference on Rewriting Techniques and Applications, volume 2706 of LNCS, 2003.
6. F. Blanqui. Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science, 15(1):37-92, 2005.
7. F. Blanqui. Inductive types in the Calculus of Algebraic Constructions. Fundamenta Informaticae, 65(1-2):61-86, 2005.
8. F. Blanqui and C. Riba. Combining typing and size constraints for checking termination of higher-order conditional rewriting systems. In Proc. LPAR, to appear in LNAI, LNCS, 2006.
9. F. Blanqui. (HO)RPO revisited, 2006. Manuscript.
10. F. Blanqui. Higher-order dependency pairs. In Proceedings of the 8th International Workshop on Termination, 2006.
11. Cristina Borralleras and Albert Rubio. A monotonie, higher-order semantic path ordering. In Proceedings LPAR, Lecture Notes in Computer Science. Springer Verlag, 2006.
12. Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science, 1990.
13. Andreas Podelski Byron Cook and Andrey Rybalchenko. Termination proofs for systems code, 2004. Manuscript.
14. Coq Development Team. The Coq Proof Assistant Reference Manual, Version 8.0. INRIA Rocquencourt, France, 2004. http://coq.inria.fr/.
15. Nachum Dershowitz and Jean-Pierre Jouannaud. Rewrite systems. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, volume B, pages 243-309. North Holland, 1990.
16. Neil Jones and Nina Bohr. Termination analysis of the untyped λ-calculus. In Rewriting techniques and Applications, pages 1-23. Springer Verlag, 2004. LNCS 3091.
17. Jean-Pierre Jouannaud and Mitsuhiro Okada. Executable higher-order algebraic specification languages. In Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam, pages 350-361, 1991.
18. Jean-Pierre Jouannaud and Mitsuhiro Okada. Abstract data type systems. Theoretical Computer Science, 173(2):349-391, February 1997.
19. Jean-Pierre Jouannaud and Albert Rubio. The higher-order recursive path ordering. In Giuseppe Longo, editor, Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy, July 1999.
20. Jean-Pierre Jouannaud and Albert Rubio. Higher-order orderings for normal rewriting. In Proc. 17th International Conference on Rewriting Techniques and Applications, Seattle, Washington, USA, 2006.
21. Jean-Pierre Jouannaud and Albert Rubio. Polymorphic higher-order recursive path orderings. Journal of the ACM, submitted.
22. Peter Scneider-Kamp Jürgen Giesl, Stephan Swiderski and René Thiemann. Automated termination analysis for haskell: Form term rewriting to programming languages. In Rewriting techniques and Applications, pages 297-312. Springer Verlag, 2006. LNCS 4098.
23. Mitsuhiro Okada. Strong normalizability for the combined system of the typed lambda calculus and an arbitrary convergent term rewrite system. In Proc. of the 20th Int. Symp. on Symbolic and Algebraic Computation, Portland, Oregon, USA, 1989.
24. Christine Paulin-Mohring. Inductive definitions in the system COQ. In Typed Lambda Calculi and Applications, pages 328-345. Springer Verlag, 1993. LNCS 664.
25. Masahiko Sakai and Keiichirou Kusakari. On dependency pairs method for proving termination of higher-order rewrite systems. IEICE-Transactions on Information and Systems, E88-D (3):583-593, 2005.
26. Daria Walukiewicz-Chrzaszcz. Termination of rewriting in the Calculus of Constructions. In Proceedings of the Workshop on Logical Frameworks and Metalanguages, Santa Barbara, California, 2000. Satellite workshop of LICS'2000.