{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,17]],"date-time":"2026-01-17T19:59:52Z","timestamp":1768679992072,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540290513","type":"print"},{"value":"9783540317302","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11559306_12","type":"book-chapter","created":{"date-parts":[[2005,9,27]],"date-time":"2005-09-27T08:50:36Z","timestamp":1127811036000},"page":"216-231","source":"Crossref","is-referenced-by-count":70,"title":["Proving and Disproving Termination of Higher-Order Functions"],"prefix":"10.1007","author":[{"given":"J\u00fcrgen","family":"Giesl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ren\u00e9","family":"Thiemann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Peter","family":"Schneider-Kamp","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-44881-0_27","volume-title":"Rewriting Techniques and Applications","author":"T. Aoto","year":"2003","unstructured":"Aoto, T., Yamada, T.: Termination of simply typed term rewriting systems by translation and labelling. In: Nieuwenhuis, R. (ed.) RTA 2003. LNCS, vol.\u00a02706, pp. 380\u2013394. Springer, Heidelberg (2003)"},{"key":"12_CR2","unstructured":"Aoto, T., Yamada, T.: Termination of simply typed applicative term rewriting systems. In: Proc. HOR 2004, Report AIB-2004-03, RWTH, pp. 61\u201365 (2004)"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-540-32033-3_10","volume-title":"Term Rewriting and Applications","author":"T. Aoto","year":"2005","unstructured":"Aoto, T., Yamada, T.: Dependency pairs for simply typed term rewriting. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 120\u2013134. Springer, Heidelberg (2005)"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0304-3975(99)00207-8","volume":"236","author":"T. Arts","year":"2000","unstructured":"Arts, T., Giesl, J.: Termination of term rewriting using dependency pairs. Theoretical Computer Science\u00a0236, 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Baader, F., Nipkow, T.: Term Rewriting and All That. Cambridge (1998)","DOI":"10.1017\/CBO9781139172752"},{"key":"12_CR6","volume-title":"Introduction to Functional Prog. using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Prog. using Haskell. Prentice-Hall, Englewood Cliffs (1998)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1007\/978-3-540-25979-4_2","volume-title":"Rewriting Techniques and Applications","author":"F. Blanqui","year":"2004","unstructured":"Blanqui, F.: A type-based termination criterion for dependently-typed higher-order rewrite systems. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 24\u201339. Springer, Heidelberg (2004)"},{"key":"12_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1007\/3-540-45653-8_37","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"C. Borralleras","year":"2001","unstructured":"Borralleras, C., Rubio, A.: A monotonic higher-order semantic path ordering. In: Nieuwenhuis, R., Voronkov, A. (eds.) LPAR 2001. LNCS (LNAI), vol.\u00a02250, pp. 531\u2013547. Springer, Heidelberg (2001)"},{"key":"12_CR9","unstructured":"Contejean, E., March\u00e9, C., Monate, B., Urbain, X.: CiME, http:\/\/cime.lri.fr"},{"key":"12_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/S0747-7171(87)80022-6","volume":"3","author":"N. Dershowitz","year":"1987","unstructured":"Dershowitz, N.: Termination of rewriting. J. Symb. Comp.\u00a03, 69\u2013116 (1987)","journal-title":"J. Symb. Comp."},{"key":"12_CR11","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-74769-4","volume-title":"Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezifikationen","author":"K. Drosten","year":"1989","unstructured":"Drosten, K.: Termersetzungssysteme: Grundlagen der Prototyp-Generierung algebraischer Spezifikationen. Springer, Heidelberg (1989)"},{"issue":"1,2","key":"12_CR12","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1007\/s002000100063","volume":"12","author":"J. Giesl","year":"2001","unstructured":"Giesl, J., Arts, T.: Verification of Erlang processes by dependency pairs. Appl. Algebra in Engineering, Communication and Computing\u00a012(1,2), 39\u201372 (2001)","journal-title":"Appl. Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"12_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1006\/jsco.2002.0541","volume":"34","author":"J. Giesl","year":"2002","unstructured":"Giesl, J., Arts, T., Ohlebusch, E.: Modular termination proofs for rewriting using dependency pairs. Journal of Symbolic Computation\u00a034(1), 21\u201358 (2002)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR14","series-title":"LNAI","first-page":"165","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2003","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Improving dependency pairs. In: Y. Vardi, M., Voronkov, A. (eds.) LPAR 2003. LNCS (LNAI), vol.\u00a02850, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-25979-4_15","volume-title":"Rewriting Techniques and Applications","author":"J. Giesl","year":"2004","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Automated termination proofs with AProVE. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 210\u2013220. Springer, Heidelberg (2004)"},{"key":"12_CR16","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1007\/978-3-540-32275-7_21","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"J. Giesl","year":"2005","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: The DP framework: Combining techniques for autom. termination proofs. In: Baader, F., Voronkov, A. (eds.) LPAR 2004. LNCS (LNAI), vol.\u00a03452, pp. 301\u2013331. Springer, Heidelberg (2005)"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P.: Proving and disproving termination of higher-order functions. Technical Report AIB-2005-03, RWTH Aachen (2005), Available from http:\/\/aib.informatik.rwth-aachen.de","DOI":"10.1007\/11559306_12"},{"key":"12_CR18","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1007\/978-3-540-45085-6_4","volume-title":"Automated Deduction \u2013 CADE-19","author":"N. Hirokawa","year":"2003","unstructured":"Hirokawa, N., Middeldorp, A.: Automating the DP method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003)"},{"key":"12_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1007\/978-3-540-32033-3_14","volume-title":"Term Rewriting and Applications","author":"N. Hirokawa","year":"2005","unstructured":"Hirokawa, N., Middeldorp, A.: Tyrolean Termination Tool. In: Giesl, J. (ed.) RTA 2005. LNCS, vol.\u00a03467, pp. 175\u2013184. Springer, Heidelberg (2005)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Jouannaud, J.-P., Rubio, A.: Higher-order recursive path orderings. In: Proc. LICS 1999, pp. 402\u2013411 (1999)","DOI":"10.1109\/LICS.1999.782635"},{"issue":"2","key":"12_CR21","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0304-3975(91)90189-9","volume":"81","author":"D. Kapur","year":"1991","unstructured":"Kapur, D., Musser, D., Narendran, P., Stillman, J.: Semi-unification. Theoretical Computer Science\u00a081(2), 169\u2013187 (1991)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR22","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1006\/jsco.1996.0002","volume":"21","author":"R. Kennaway","year":"1996","unstructured":"Kennaway, R., Klop, J.W., Sleep, R., de Vries, F.-J.: Comparing curried and uncurried rewriting. Journal of Symbolic Computation\u00a021(1), 15\u201339 (1996)","journal-title":"Journal of Symbolic Computation"},{"key":"12_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/10704567_3","volume-title":"Principles and Practice of Declarative Programming","author":"K. Kusakari","year":"1999","unstructured":"Kusakari, K., Nakamura, M., Toyama, Y.: Argument filtering transformation. In: Nadathur, G. (ed.) PPDP 1999. LNCS, vol.\u00a01702, pp. 48\u201362. Springer, Heidelberg (1999)"},{"key":"12_CR24","unstructured":"Kusakari, K.: On proving termination of term rewriting systems with higher-order variables. IPSJ Transactions on Programming,42(SIG 7 (PRO 11)), 35\u201345 (2001)"},{"key":"12_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/BFb0055142","volume-title":"Theorem Proving in Higher Order Logics","author":"M. Lifantsev","year":"1998","unstructured":"Lifantsev, M., Bachmair, L.: An LPO-based termination ordering for higher-order terms without \u03bb-abstraction. In: Grundy, J., Newey, M. (eds.) TPHOLs 1998. LNCS, vol.\u00a01479, pp. 277\u2013293. Springer, Heidelberg (1998)"},{"key":"12_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-09981-6_19","volume-title":"International Symposium on Programming","author":"A. Mycroft","year":"1980","unstructured":"Mycroft, A.: The theory and practice of transforming call-by-need into call-by-value. In: Robinet, B. (ed.) Programming 1980. LNCS, vol.\u00a083, pp. 269\u2013281. Springer, Heidelberg (1980)"},{"key":"12_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BFb0054263","volume-title":"Automated Deduction - CADE-15","author":"A. Oliart","year":"1998","unstructured":"Oliart, A., Snyder, W.: A fast algorithm for uniform semi-unification. In: Kirchner, C., Kirchner, H. (eds.) CADE 1998. LNCS, vol.\u00a01421, pp. 239\u2013253. Springer, Heidelberg (1998)"},{"key":"12_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/3-540-16780-3_81","volume-title":"8th International Conference on Automated Deduction","author":"D.A. Plaisted","year":"1986","unstructured":"Plaisted, D.A.: A simple non-termination test for the Knuth-Bendix method. In: Siekmann, J.H. (ed.) CADE 1986. LNCS, vol.\u00a0230, pp. 79\u201388. Springer, Heidelberg (1986)"},{"key":"12_CR29","unstructured":"van de Pol. J.: Termination of higher-order rewrite systems. PhD, Utrecht (1996)"},{"issue":"8","key":"12_CR30","first-page":"1025","volume":"E84-D","author":"M. Sakai","year":"2001","unstructured":"Sakai, M., Watanabe, Y., Sakabe, T.: An extension of dependency pair method for proving termination of higher-order rewrite systems. IEICE Transactions on Information and Systems\u00a0E84-D(8), 1025\u20131032 (2001)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"Sakai, M., Kusakari, K.: On dependency pair method for proving termination of higher-order rewrite systems. IEICE Trans. on Inf. & Sys. (2005) (To appear)","DOI":"10.1093\/ietisy\/e88-d.3.583"},{"key":"12_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/978-3-540-25984-8_4","volume-title":"Automated Reasoning","author":"R. Thiemann","year":"2004","unstructured":"Thiemann, R., Giesl, J., Schneider-Kamp, P.: Improved modular termination proofs using dependency pairs. In: Basin, D., Rusinowitch, M. (eds.) IJCAR 2004. LNCS, vol.\u00a03097, pp. 75\u201390. Springer, Heidelberg (2004)"},{"key":"12_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-540-25979-4_3","volume-title":"Rewriting Techniques and Applications","author":"Y. Toyama","year":"2004","unstructured":"Toyama, Y.: Termination of S-expression rewriting systems: Lexicographic path ordering for higher-order terms. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 40\u201354. Springer, Heidelberg (2004)"},{"key":"12_CR34","unstructured":"TPDB. web page, http:\/\/www.lri.fr\/~marche\/termination-competition\/"},{"key":"12_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1987","unstructured":"Wadler, P., Hughes, J.: Projections for strictness analysis. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 385\u2013407. Springer, Heidelberg (1987)"},{"key":"12_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-3-540-25979-4_6","volume-title":"Rewriting Techniques and Applications","author":"J. Waldmann","year":"2004","unstructured":"Waldmann, J.: Matchbox: A tool for match-bounded string rewriting. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 85\u201394. Springer, Heidelberg (2004)"},{"key":"12_CR37","doi-asserted-by":"crossref","unstructured":"Zantema, H.: TORPA: Termination of string rewriting proved automatically. Journal of Automated Reasoning (2005) (To appear)","DOI":"10.1007\/s10817-005-6545-0"}],"container-title":["Lecture Notes in Computer Science","Frontiers of Combining Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11559306_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T14:49:21Z","timestamp":1605624561000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11559306_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540290513","9783540317302"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/11559306_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}