{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T11:53:23Z","timestamp":1648986803240},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,11,1]],"date-time":"2011-11-01T00:00:00Z","timestamp":1320105600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Higher-Order Symb Comput"],"published-print":{"date-parts":[[2011,11]]},"DOI":"10.1007\/s10990-012-9086-3","type":"journal-article","created":{"date-parts":[[2012,8,28]],"date-time":"2012-08-28T06:54:37Z","timestamp":1346136877000},"page":"281-309","source":"Crossref","is-referenced-by-count":1,"title":["Pruning with improving sequences in lazy functional programs"],"prefix":"10.1007","volume":"24","author":[{"given":"Hideya","family":"Iwasaki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takeshi","family":"Morimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yasunao","family":"Takano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2012,8,29]]},"reference":[{"issue":"6","key":"9086_CR1","doi-asserted-by":"crossref","first-page":"990","DOI":"10.1145\/1186632.1186634","volume":"28","author":"U.A. Acar","year":"2006","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R.: Adaptive functional programming. ACM Trans. Program. Lang. Syst. 28(6), 990\u20131034 (2006)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9086_CR2","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1145\/604131.604133","volume-title":"Proceedings of 30th. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2003)","author":"U.A. Acar","year":"2003","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R.: Selective memoization. In: Proceedings of 30th. ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 2003), pp.\u00a014\u201325 (2003)"},{"key":"9086_CR3","volume-title":"Introduction to Functional Programming Using Haskell","author":"R. Bird","year":"1998","unstructured":"Bird, R.: Introduction to Functional Programming Using Haskell, 2nd edn. Prentice Hall, Englewood Cliffs (1998)","edition":"2"},{"issue":"1","key":"9086_CR4","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1016\/0020-0190(87)90198-0","volume":"24","author":"R. Bird","year":"1987","unstructured":"Bird, R., Hughes, J.: The alpha-beta algorithm: an exercise in program transformation. Inf. Process. Lett. 24(1), 53\u201357 (1987)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"9086_CR5","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1017\/S0956796800000046","volume":"1","author":"F.W. Burton","year":"1991","unstructured":"Burton, F.W.: Encapsulating non-determinacy in an abstract data type with determinate semantics. J.\u00a0Funct. Program. 1(1), 3\u201320 (1991)","journal-title":"J.\u00a0Funct. Program."},{"key":"9086_CR6","first-page":"26","volume-title":"Proceedings of 7th International Conference on Functional Programming (ICFP 2002)","author":"M. Carlsson","year":"2002","unstructured":"Carlsson, M.: Monads for incremental computing. In: Proceedings of 7th International Conference on Functional Programming (ICFP 2002), pp.\u00a026\u201335. ACM Press, New York (2002)"},{"key":"9086_CR7","first-page":"287","volume-title":"Proceedings of 8th International Conference on Functional Programming (ICFP 2003)","author":"R. Ennals","year":"2003","unstructured":"Ennals, R., Peyton Jones, S.L.: Optimistic evaluation: an adaptive evaluation strategy for non-strict programs. In: Proceedings of 8th International Conference on Functional Programming (ICFP 2003), pp.\u00a0287\u2013298. ACM Press, New York (2003)"},{"key":"9086_CR8","volume-title":"Fundamentals of Computer Algorithms","author":"E. Horowitz","year":"1978","unstructured":"Horowitz, E., Sahni, S.: Fundamentals of Computer Algorithms. Computer Science Press, New York (1978)"},{"key":"9086_CR9","first-page":"73","volume-title":"Proceedings of 1996 International Conference on Functional Programming (ICFP 1996)","author":"Z. Hu","year":"1996","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Deriving structural hylomorphisms from recursive definitions. In: Proceedings of 1996 International Conference on Functional Programming (ICFP 1996), pp.\u00a073\u201382. ACM Press, New York (1996)"},{"issue":"2","key":"9086_CR10","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1007\/BF03037434","volume":"17","author":"Z. Hu","year":"1999","unstructured":"Hu, Z., Iwasaki, H., Takeichi, M.: Calculating accumulations. New Gener. Comput. 17(2), 153\u2013173 (1999)","journal-title":"New Gener. Comput."},{"issue":"4","key":"9086_CR11","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/0004-3702(75)90019-3","volume":"6","author":"D.E. Knuth","year":"1975","unstructured":"Knuth, D.E., Moore, R.W.: An analysis of alpha-beta pruning. Artif. Intell. 6(4), 293\u2013326 (1975)","journal-title":"Artif. Intell."},{"issue":"4","key":"9086_CR12","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E.L. Lawler","year":"1966","unstructured":"Lawler, E.L., Wood, D.E.: Branch-and-bound methods: a survey. Oper. Res. 14(4), 699\u2013719 (1966)","journal-title":"Oper. Res."},{"key":"9086_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1145\/331960.331977","volume-title":"Proceedings of 2nd Conference on Domain-Specific Languages (DSL 1999)","author":"D. Leijen","year":"1999","unstructured":"Leijen, D., Meijer, D.: Domain specific embedded compilers. In: Proceedings of 2nd Conference on Domain-Specific Languages (DSL 1999), pp.\u00a0109\u2013122. ACM Press, New York (1999)"},{"issue":"3","key":"9086_CR14","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1145\/291889.291895","volume":"20","author":"Y.A. Liu","year":"1998","unstructured":"Liu, Y.A., Stoller, S.D., Teitelbaum, T.: Static caching for incremental computation. ACM Trans. Program. Lang. Syst. 20(3), 546\u2013585 (1998)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"9086_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"Proceedings of 1991 International Conference on Functional Programming and Computer Architecture (FPCA 1991)","author":"E. Meijer","year":"1991","unstructured":"Meijer, E., Fokkinga, M.M., Paterson, R.: Functional programming with bananas, lenses, envelopes and barbed wire. In: Proceedings of 1991 International Conference on Functional Programming and Computer Architecture (FPCA 1991). Lecture Notes in Computer Science, vol. 523, pp.\u00a0124\u2013144. Springer, Berlin (1991)"},{"key":"9086_CR16","series-title":"Lecture Notes in Computer Science","first-page":"65","volume-title":"Proceedings of 9th International Symposium on Practical Aspects of Declarative Languages (PADL 2007)","author":"T. Morimoto","year":"2007","unstructured":"Morimoto, T., Takano, Y., Iwasaki, H.: Instantly turning a naive exhaustive search into three efficient searches with pruning. In: Proceedings of 9th International Symposium on Practical Aspects of Declarative Languages (PADL 2007). Lecture Notes in Computer Science, vol. 4354, pp.\u00a065\u201379. Springer, Berlin (2007)"},{"key":"9086_CR17","doi-asserted-by":"crossref","first-page":"502","DOI":"10.1145\/158511.158710","volume-title":"Proceedings of 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1993)","author":"G. Ramalingam","year":"1993","unstructured":"Ramalingam, G., Reps, T.W.: A categorized bibliography on incremental computation. In: Proceedings of 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL 1993), pp.\u00a0502\u2013510. ACM Press, New York (1993)"},{"key":"9086_CR18","first-page":"306","volume-title":"Proceedings of 1995 International Conference on Functional Programming and Computer Architecture (FPCA 1995)","author":"A. Takano","year":"1995","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Proceedings of 1995 International Conference on Functional Programming and Computer Architecture (FPCA 1995), pp.\u00a0306\u2013313. ACM Press, New York (1995)"},{"key":"9086_CR19","unstructured":"Tanaka, K.: Studies on parallel functional programming. M.Phil. thesis, Graduate School of Engineering, The University of Tokyo (1993)"}],"container-title":["Higher-Order and Symbolic Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9086-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10990-012-9086-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10990-012-9086-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T01:29:42Z","timestamp":1559352582000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10990-012-9086-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11]]},"references-count":19,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,11]]}},"alternative-id":["9086"],"URL":"https:\/\/doi.org\/10.1007\/s10990-012-9086-3","relation":{},"ISSN":["1388-3690","1573-0557"],"issn-type":[{"value":"1388-3690","type":"print"},{"value":"1573-0557","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,11]]}}}