{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,12]],"date-time":"2025-01-12T05:20:16Z","timestamp":1736659216136,"version":"3.32.0"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540482819"},{"type":"electronic","value":"9783540482826"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11916277_1","type":"book-chapter","created":{"date-parts":[[2006,10,17]],"date-time":"2006-10-17T18:32:59Z","timestamp":1161109979000},"page":"1-14","source":"Crossref","is-referenced-by-count":9,"title":["Higher-Order Termination: From Kruskal to Computability"],"prefix":"10.1007","author":[{"given":"Fr\u00e9d\u00e9ric","family":"Blanqui","sequence":"first","affiliation":[]},{"given":"Jean-Pierre","family":"Jouannaud","sequence":"additional","affiliation":[]},{"given":"Albert","family":"Rubio","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"1_CR1","series-title":"Lecture Notes in Computer Science","volume-title":"Conditional and Typed Rewriting Systems","author":"F. Barbanera","year":"1991","unstructured":"Barbanera, F.: Adding algebraic rewriting to the calculus of constructions: Strong normalization preserved. In: Okada, M., Kaplan, S. (eds.) CTRS 1990. LNCS, vol.\u00a0516. Springer, Heidelberg (1991)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Barbanera, F., Fern\u00e1ndez, M., Geuvers, H.: Modularity of strong normalization and confluence in the \u03bb-algebraic-cube. In: Proc. 9th IEEE Symp. Logic in Computer Science, pp. 406\u2013415 (1994)","DOI":"10.1109\/LICS.1994.316049"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/3-540-48685-2_25","volume-title":"Rewriting Techniques and Applications","author":"F. Blanqui","year":"1999","unstructured":"Blanqui, F., Jouannaud, J.-P., Okada, M.: The Calculus of Algebraic Constructions. In: Narendran, P., Rusinowitch, M. (eds.) RTA 1999. LNCS, vol.\u00a01631, p. 301. Springer, Heidelberg (1999)"},{"issue":"1-2","key":"1_CR4","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/S0304-3975(00)00347-9","volume":"272","author":"F. Blanqui","year":"2002","unstructured":"Blanqui, F., Jouannaud, J.-P., Okada, M.: Inductive-Data-Type Systems. Theoretical Computer Science\u00a0272(1-2), 41\u201368 (2002)","journal-title":"Theoretical Computer Science"},{"key":"1_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44881-0_28","volume-title":"Rewriting Techniques and Applications","author":"F. Blanqui","year":"2003","unstructured":"Blanqui, F.: Rewriting modulo in Deduction modulo. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706. Springer, Heidelberg (2003)"},{"issue":"1","key":"1_CR6","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1017\/S0960129504004426","volume":"15","author":"F. Blanqui","year":"2005","unstructured":"Blanqui, F.: Definitions by rewriting in the Calculus of Constructions. Mathematical Structures in Computer Science\u00a015(1), 37\u201392 (2005)","journal-title":"Mathematical Structures in Computer Science"},{"issue":"1-2","key":"1_CR7","first-page":"61","volume":"65","author":"F. Blanqui","year":"2005","unstructured":"Blanqui, F.: Inductive types in the Calculus of Algebraic Constructions. Fundamenta Informaticae\u00a065(1-2), 61\u201386 (2005)","journal-title":"Fundamenta Informaticae"},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1007\/11916277_8","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"F. Blanqui","year":"2006","unstructured":"Blanqui, F., Riba, C.: Combining typing and size constraints for checking the termination of higher-order conditional rewrite systems. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS, vol.\u00a04246, pp. 105\u2013119. Springer, Heidelberg (2006)"},{"key":"1_CR9","unstructured":"Blanqui, F.: (HO)RPO revisited (manuscript, 2006)"},{"key":"1_CR10","unstructured":"Blanqui, F.: Higher-order dependency pairs. In: Proceedings of the 8th International Workshop on Termination (2006)"},{"key":"1_CR11","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings LPAR","author":"C. Borralleras","year":"2006","unstructured":"Borralleras, C., Rubio, A.: A monotonic, higher-order semantic path ordering. In: Proceedings LPAR. LNCS. Springer, Heidelberg (2006)"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Breazu-Tannen, V., Gallier, J.: Polymorphic rewriting conserves algebraic strong normalization. Theoretical Computer Science (1990)","DOI":"10.1007\/BFb0035757"},{"key":"1_CR13","unstructured":"Cook, A.P.B., Rybalchenko, A.: Termination proofs for systems code (manuscript, 2004)"},{"key":"1_CR14","unstructured":"Coq Development Team: The Coq Proof Assistant Reference Manual, Version 8.0. INRIA Rocquencourt, France (2004), http:\/\/coq.inria.fr\/"},{"key":"1_CR15","first-page":"243","volume-title":"Handbook of Theoretical Computer Science","author":"N. Dershowitz","year":"1990","unstructured":"Dershowitz, N., Jouannaud, J.-P.: Rewrite systems. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 243\u2013309. North-Holland, Amsterdam (1990)"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-25979-4_1","volume-title":"Rewriting Techniques and Applications","author":"N.D. Jones","year":"2004","unstructured":"Jones, N.D., Bohr, N.: Termination analysis of the untyped \u03bb-calculus. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 1\u201323. Springer, Heidelberg (2004)"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Okada, M.: Executable higher-order algebraic specification languages. In: Proc. 6th IEEE Symp. Logic in Computer Science, Amsterdam, pp. 350\u2013361 (1991)","DOI":"10.1109\/LICS.1991.151659"},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1016\/S0304-3975(96)00161-2","volume":"173","author":"J.-P. Jouannaud","year":"1997","unstructured":"Jouannaud, J.-P., Okada, M.: Abstract data type systems. Theoretical Computer Science\u00a0173(2), 349\u2013391 (1997)","journal-title":"Theoretical Computer Science"},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: Longo, G. (ed.) Fourteenth Annual IEEE Symposium on Logic in Computer Science, Trento, Italy (July 1999)","DOI":"10.1109\/LICS.1999.782635"},{"key":"1_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/11805618_29","volume-title":"Term Rewriting and Applications","author":"J.-P. Jouannaud","year":"2006","unstructured":"Jouannaud, J.-P., Rubio, A.: Higher-order orderings for normal rewriting. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 387\u2013399. Springer, Heidelberg (2006)"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Rubio, A.: Polymorphic higher-order recursive path orderings. Journal of the ACM (submitted)","DOI":"10.1145\/1206035.1206037"},{"key":"1_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/11805618_23","volume-title":"Term Rewriting and Applications","author":"P.S.-K. J\u00fcrgen Giesl","year":"2006","unstructured":"J\u00fcrgen Giesl, P.S.-K., Swiderski, S., Thiemann, R.: Automated termination analysis for haskell: From term rewriting to programming languages. In: Pfenning, F. (ed.) RTA 2006. LNCS, vol.\u00a04098, pp. 297\u2013312. Springer, Heidelberg (2006)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Okada, M.: 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)","DOI":"10.1145\/74540.74582"},{"key":"1_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"328","DOI":"10.1007\/BFb0037116","volume-title":"Typed Lambda Calculi and Applications","author":"C. Paulin-Mohring","year":"1993","unstructured":"Paulin-Mohring, C.: Inductive definitions in the system COQ. In: Bezem, M., Groote, J.F. (eds.) TLCA 1993. LNCS, vol.\u00a0664, pp. 328\u2013345. Springer, Heidelberg (1993)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Sakai, M., Kusakari, K.: On dependency pairs method for proving termination of higher-order rewrite systems. IEICE-Transactions on Information and Systems\u00a0E88-D(3), 583\u2013593 (2005)","DOI":"10.1093\/ietisy\/e88-d.3.583"},{"key":"1_CR26","unstructured":"Wa\u0142ukiewicz-Chrzaszcz, D.: Termination of rewriting in the Calculus of Constructions. In: Proceedings of the Workshop on Logical Frameworks and Meta-languages. Satellite workshop of LICS 2000, Santa Barbara, California (2000)"}],"container-title":["Lecture Notes in Computer Science","Logic for Programming, Artificial Intelligence, and Reasoning"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11916277_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,11]],"date-time":"2025-01-11T15:42:09Z","timestamp":1736610129000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11916277_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540482819","9783540482826"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/11916277_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}