{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T01:51:17Z","timestamp":1725587477647},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642214929"},{"type":"electronic","value":"9783642214936"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21493-6_13","type":"book-chapter","created":{"date-parts":[[2011,6,20]],"date-time":"2011-06-20T08:42:44Z","timestamp":1308559364000},"page":"201-215","source":"Crossref","is-referenced-by-count":3,"title":["Simplifying Algebraic Functional Systems"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Kop","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-87531-4_1","volume-title":"Computer Science Logic","author":"F. Blanqui","year":"2008","unstructured":"Blanqui, F., Jouannaud, J.-P., Rubio, A.: The computability path ordering: The end of a quest. In: Kaminski, M., Martini, S. (eds.) CSL 2008. LNCS, vol.\u00a05213, pp. 1\u201314. Springer, Heidelberg (2008)"},{"key":"13_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"667","DOI":"10.1007\/978-3-540-89439-1_46","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"N. Hirokawa","year":"2008","unstructured":"Hirokawa, N., Middeldorp, A., Zankl, H.: Uncurrying for termination. In: Cervesato, I., Veith, H., Voronkov, A. (eds.) LPAR 2008. LNCS (LNAI), vol.\u00a05330, pp. 667\u2013681. Springer, Heidelberg (2008)"},{"key":"13_CR3","first-page":"350","volume-title":"6th IEEE Symposium on Logic In Computer Science","author":"J.-P. Jouannaud","year":"1991","unstructured":"Jouannaud, J.-P., Okada, M.: A computation model for executable higher-order algebraic specification languages. In: 6th IEEE Symposium on Logic In Computer Science, pp. 350\u2013361. IEEE Press, Amsterdam (1991)"},{"key":"13_CR4","first-page":"402","volume-title":"14th IEEE Symposium on Logic In Computer Science","author":"J.-P. Jouannaud","year":"1999","unstructured":"Jouannaud, J.-P., Rubio, A.: The higher-order recursive path ordering. In: 14th IEEE Symposium on Logic In Computer Science, pp. 402\u2013411. IEEE Press, Los Alamitos (1999)"},{"key":"13_CR5","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1006\/jsco.1995.1035","volume":"19","author":"S. Kahrs","year":"1995","unstructured":"Kahrs, S.: Confluence of curried term-rewriting systems. Journal of Symbolic Computing\u00a019, 601\u2013623 (1995)","journal-title":"Journal of Symbolic Computing"},{"issue":"1","key":"13_CR6","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, M.R., de Vries, F.J.: Comparing curried and uncurried rewriting. Journal of Symbolic Computing\u00a021(1), 15\u201339 (1996)","journal-title":"Journal of Symbolic Computing"},{"key":"13_CR7","unstructured":"Kop, C.: Wanda, \n                    \n                      http:\/\/www.few.vu.nl\/~kop\/code.html"},{"key":"13_CR8","unstructured":"Kop, C., van Raamsdonk, F.: Higher order dependency pairs for algebraic functional systems. In: RTA 2011 (to appear, 2011)"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"2007","DOI":"10.1587\/transinf.E92.D.2007","volume":"92","author":"K. Kusakari","year":"2009","unstructured":"Kusakari, K., Isogai, Y., Sakai, M., Blanqui, F.: Static dependency pair method based on strong computability for higher-order rewrite systems. IEICE Transactions on Information and Systems\u00a092, 2007\u20132015 (2009)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"13_CR10","first-page":"342","volume-title":"6th IEEE Symposium on Logic in Computer Science","author":"T. Nipkow","year":"1991","unstructured":"Nipkow, T.: Higher-order critical pairs. In: 6th IEEE Symposium on Logic in Computer Science, pp. 342\u2013349. IEEE Press, Amsterdam (1991)"},{"key":"13_CR11","unstructured":"van de Pol, J.C.: Termination of Higher-order Rewite Systems. PhD thesis, University of Utrecht (1996)"},{"issue":"8","key":"13_CR12","first-page":"1025","volume":"E84-D","author":"M. Sakai","year":"2001","unstructured":"Sakai, M., Watanabe, Y., Sakabe, T.: An extension of the 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":"13_CR13","unstructured":"Termination Portal (Wiki), \n                    \n                      http:\/\/www.termination-portal.org\/"}],"container-title":["Lecture Notes in Computer Science","Algebraic Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21493-6_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T03:31:54Z","timestamp":1553830314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21493-6_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642214929","9783642214936"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21493-6_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}