{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T20:04:06Z","timestamp":1725566646407},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540255963"},{"type":"electronic","value":"9783540320333"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-32033-3_10","type":"book-chapter","created":{"date-parts":[[2010,9,27]],"date-time":"2010-09-27T20:20:02Z","timestamp":1285618802000},"page":"120-134","source":"Crossref","is-referenced-by-count":9,"title":["Dependency Pairs for Simply Typed Term Rewriting"],"prefix":"10.1007","author":[{"given":"Takahito","family":"Aoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toshiyuki","family":"Yamada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_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)"},{"unstructured":"Aoto, T., Yamada, T.: Termination of simply-typed applicative term rewriting systems. In: Proceedings of the 2nd International Workshop on Higher-Order Rewriting (2004)","key":"10_CR2"},{"issue":"1-2","key":"10_CR3","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(1-2), 133\u2013178 (2000)","journal-title":"Theoretical Computer Science"},{"issue":"1\/2","key":"10_CR4","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. Applicable Algebra in Engineering, Communication and Computing\u00a012(1\/2), 39\u201372 (2001)","journal-title":"Applicable Algebra in Engineering, Communication and Computing"},{"issue":"1","key":"10_CR5","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":"10_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-39813-4_11","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, vol.\u00a02850, pp. 165\u2013179. Springer, Heidelberg (2003)"},{"doi-asserted-by":"crossref","unstructured":"Giesl, J., Thiemann, R., Schneider-Kamp, P., Falke, S.: Mechanizing dependency pairs. Research Report 2003\u201308, Aachener Informatik-Bericht (2003)","key":"10_CR7","DOI":"10.1007\/978-3-540-39813-4_11"},{"key":"10_CR8","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":"10_CR9","series-title":"Lecture Notes in Artificial Intelligence","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 dependency pair method. In: Baader, F. (ed.) CADE 2003. LNCS (LNAI), vol.\u00a02741, pp. 32\u201346. Springer, Heidelberg (2003)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/978-3-540-25979-4_18","volume-title":"Rewriting Techniques and Applications","author":"N. Hirokawa","year":"2004","unstructured":"Hirokawa, N., Middeldorp, A.: Dependency pairs revisited. In: van Oostrom, V. (ed.) RTA 2004. LNCS, vol.\u00a03091, pp. 249\u2013268. Springer, Heidelberg (2004)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1109\/LICS.1991.151659","volume-title":"Proceedings of the 6th IEEE Symposium on Logic in Computer Science","author":"J.-P. Jouannaud","year":"1991","unstructured":"Jouannaud, J.-P., Okada, M.: Executable higher-order algebraic specification languages. In: Proceedings of the 6th IEEE Symposium on Logic in Computer Science, pp. 350\u2013361. IEEE Press, Los Alamitos (1991)"},{"unstructured":"Klop, J.W.: Combinatory Reduction Systems. PhD thesis, Rijksuniversiteit, Utrecht (1980)","key":"10_CR12"},{"issue":"SIG 7 PRO 11","key":"10_CR13","first-page":"35","volume":"42","author":"K. Kusakari","year":"2001","unstructured":"Kusakari, K.: On proving termination of term rewriting systems with higher-order variables. IPSJ Transactions on Programming\u00a042(SIG 7 PRO 11), 35\u201345 (2001)","journal-title":"IPSJ Transactions on Programming"},{"issue":"2","key":"10_CR14","first-page":"352","volume":"E87\u2013D","author":"K. Kusakari","year":"2003","unstructured":"Kusakari, K.: Higher-order path orders based on computability. IEICE Transactions on Information and Systems\u00a0E87\u2013D(2), 352\u2013359 (2003)","journal-title":"IEICE Transactions on Information and Systems"},{"issue":"1","key":"10_CR15","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(97)00143-6","volume":"192","author":"R. Mayr","year":"1998","unstructured":"Mayr, R., Nipkow, T.: Higher-order rewrite systems and their confluence. Theoretical Computer Science\u00a0192(1), 3\u201329 (1998)","journal-title":"Theoretical Computer Science"},{"issue":"6","key":"10_CR16","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S1571-0661(04)80598-X","volume":"70","author":"A. Middeldorp","year":"2002","unstructured":"Middeldorp, A.: Approximations for strategies and termination. Electronic Notes in Theoretical Computer Science\u00a070(6), 1\u201320 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"unstructured":"Sakai, M., Kusakari, K.: On new dependency pair method for proving termination of higher-order rewrite systems. In: Proceedings of the International Workshop on Rewriting in Proof and Computation, pp. 176\u2013187 (2001)","key":"10_CR17"},{"issue":"8","key":"10_CR18","first-page":"1025","volume":"E84\u2013D","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\u2013D(8), 1025\u20131032 (2001)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"10_CR19","series-title":"Lecture Notes in Artificial Intelligence","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 (LNAI), vol.\u00a03097, pp. 75\u201390. Springer, Heidelberg (2004)"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1007\/3-540-45127-7_25","volume-title":"Rewriting Techniques and Applications","author":"T. Yamada","year":"2001","unstructured":"Yamada, T.: Confluence and termination of simply typed term rewriting systems. In: Middeldorp, A. (ed.) RTA 2001. LNCS, vol.\u00a02051, pp. 338\u2013352. Springer, Heidelberg (2001)"}],"container-title":["Lecture Notes in Computer Science","Term Rewriting and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-32033-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,18]],"date-time":"2020-11-18T23:33:56Z","timestamp":1605742436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-32033-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540255963","9783540320333"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-32033-3_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}