{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:01:50Z","timestamp":1743109310857,"version":"3.40.3"},"publisher-location":"Cham","reference-count":33,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319296036"},{"type":"electronic","value":"9783319296043"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-29604-3_14","type":"book-chapter","created":{"date-parts":[[2016,2,20]],"date-time":"2016-02-20T07:53:12Z","timestamp":1455954792000},"page":"215-231","source":"Crossref","is-referenced-by-count":0,"title":["Incremental Computing with Abstract Data Structures"],"prefix":"10.1007","author":[{"given":"Akimasa","family":"Morihata","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,2,21]]},"reference":[{"issue":"6","key":"14_CR1","doi-asserted-by":"publisher","first-page":"990","DOI":"10.1145\/1186632.1186634","volume":"28","author":"UA 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":"14_CR2","doi-asserted-by":"crossref","unstructured":"Demers, A.J., Reps, T.W., Teitelbaum, T.: Incremental evaluation for attribute grammars with application to syntax-directed editors. In: Conference Record of the Eighth Annual ACM Symposium on Principles of Programming Languages, pp. 105\u2013116. ACM Press (1981)","DOI":"10.1145\/567532.567544"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Pugh, W., Teitelbaum, T.: Incremental computation via function caching. In: Conference Record of the Sixteenth Annual ACM Symposium on Principles of Programming Languages, pp. 315\u2013328. ACM Press (1989)","DOI":"10.1145\/75277.75305"},{"key":"14_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1007\/3-540-54572-7_8","volume-title":"Attribute Grammars, Applications and Systems, International Summer School SAGA 1991","author":"H Alblas","year":"1991","unstructured":"Alblas, H.: Incremental attribute evaluation. In: Alblas, H., Melichar, B. (eds.) Attribute Grammars, Applications and Systems, International Summer School SAGA 1991. Lecture Notes in Computer Science, vol. 545, pp. 215\u2013233. Springer, Heidelberg (1991)"},{"issue":"3","key":"14_CR5","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1145\/117009.117012","volume":"13","author":"SE Hudson","year":"1991","unstructured":"Hudson, S.E.: Incremental attribute evaluation: a flexible algorithm for lazy update. ACM Trans. Program. Lang. Syst. 13(3), 315\u2013341 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"issue":"2","key":"14_CR6","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1145\/103135.103137","volume":"13","author":"DM Yellin","year":"1991","unstructured":"Yellin, D.M., Strom, R.E.: INC: a language for incremental computations. ACM Trans. Program. Lang. Syst. 13(2), 211\u2013236 (1991)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"14_CR7","unstructured":"Jeuring, J.: Incremental algorithms on lists. In: Proceedings of SION Computing Science in the Netherlands, pp. 315\u2013335 (1991)"},{"key":"14_CR8","unstructured":"Jeuring, J.: Theories for algorithm calculation. Ph.D. thesis, Universiteit Utrecht (1993)"},{"key":"14_CR9","unstructured":"Acar, U.A., Blelloch, G.E., Harper, R., Vittes, J.L., Woo, S.L.M.: Dynamizing static algorithms, with applications to dynamic trees and history independence. In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004, pp. 531\u2013540. SIAM (2004)"},{"key":"14_CR10","doi-asserted-by":"crossref","unstructured":"Chen, Y., Dunfield, J., Acar, U.A.: Type-directed automatic incrementalization. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2012, pp. 299\u2013310. ACM Press (2012)","DOI":"10.1145\/2345156.2254100"},{"key":"14_CR11","doi-asserted-by":"crossref","unstructured":"Cai, Y., Giarrusso, P.G., Rendel, T., Ostermann, K.: A theory of changes for higher-order languages: incrementalizing \n                    \n                      \n                    \n                    $$\\lambda $$\n                    \n                      \n                        \u03bb\n                      \n                    \n                  -calculi by static differentiation. In: ACM SIGPLAN Conference on Programming Language Design and Implementation, PLDI 2014, pp. 145\u2013155. ACM Press (2014)","DOI":"10.1145\/2666356.2594304"},{"key":"14_CR12","doi-asserted-by":"crossref","unstructured":"Gill, A., Launchbury, J., Peyton Jones, S.: A short cut to deforestation. In: FPCA 1993 Conference on Functional Programming Languages and Computer Architecture, pp. 223\u2013232. ACM Press (1993)","DOI":"10.1145\/165180.165214"},{"key":"14_CR13","doi-asserted-by":"crossref","unstructured":"Takano, A., Meijer, E.: Shortcut deforestation in calculational form. In: Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture, pp. 306\u2013313. ACM Press (1995)","DOI":"10.1145\/224164.224221"},{"key":"14_CR14","first-page":"513","volume":"83","author":"JC Reynolds","year":"1983","unstructured":"Reynolds, J.C.: Types, abstraction and parametric polymorphism. Inf. Process. 83, 513\u2013523 (1983)","journal-title":"Inf. Process."},{"key":"14_CR15","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Theorems for free! In: FPCA 1989 Conference on Functional Programming Languages and Computer Architecture, pp. 347\u2013359. ACM Press (1989)","DOI":"10.1145\/99370.99404"},{"issue":"3","key":"14_CR16","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1145\/3828.3835","volume":"32","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Self-adjusting binary search trees. J. ACM 32(3), 652\u2013686 (1985)","journal-title":"J. ACM"},{"issue":"1","key":"14_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S0956796800001556","volume":"6","author":"RS Bird","year":"1996","unstructured":"Bird, R.S., de Moor, O., Hoogendijk, P.F.: Generic functional programming with types and relations. J. Funct. Program. 6(1), 1\u201328 (1996)","journal-title":"J. Funct. Program."},{"issue":"1\u20133","key":"14_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0167-6423(99)00022-2","volume":"37","author":"J Gibbons","year":"2000","unstructured":"Gibbons, J.: Generic downwards accumulations. Sci. Comput. Program. 37(1\u20133), 37\u201365 (2000)","journal-title":"Sci. Comput. Program."},{"issue":"5","key":"14_CR19","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1017\/S0956796897002864","volume":"7","author":"GP Huet","year":"1997","unstructured":"Huet, G.P.: The zipper. J. Funct. Program. 7(5), 549\u2013554 (1997)","journal-title":"J. Funct. Program."},{"issue":"4","key":"14_CR20","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1017\/S0956796800001908","volume":"6","author":"J Gibbons","year":"1996","unstructured":"Gibbons, J.: The third homomorphism theorem. J. Funct. Program. 6(4), 657\u2013665 (1996)","journal-title":"J. Funct. Program."},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Morihata, A.: A short cut to parallelization theorems. In: ACM SIGPLAN International Conference on Functional Programming, ICFP 2013, pp. 245\u2013256. ACM Press (2013)","DOI":"10.1145\/2544174.2500580"},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Morihata, A., Matsuzaki, K., Hu, Z., Takeichi, M.: The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, pp. 177\u2013185. ACM Press (2009)","DOI":"10.1145\/1480881.1480905"},{"key":"14_CR23","volume-title":"Algebra of Programming","author":"RS Bird","year":"1997","unstructured":"Bird, R.S., de Moor, O.: Algebra of Programming. Prentice Hall, Upper Saddle River (1997)"},{"issue":"1","key":"14_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.tcs.2005.06.002","volume":"342","author":"M Abbott","year":"2005","unstructured":"Abbott, M., Altenkirch, T., Ghani, N.: Containers: constructing strictly positive types. Theor. Comput. Sci. 342(1), 3\u201327 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR25","doi-asserted-by":"crossref","unstructured":"Ramalingam, G., Reps, T.W.: A categorized bibliography on incremental computation. In: Conference Record of the Twentieth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 502\u2013510. ACM Press (1993)","DOI":"10.1145\/158511.158710"},{"key":"14_CR26","doi-asserted-by":"crossref","unstructured":"Launchbury, J., Sheard, T.: Warm fusion: deriving build-catas from recursive definitions. In: Conference Record of FPCA 1995 SIGPLAN-SIGARCH-WG2.8 Conference on Functional Programming Languages and Computer Architecture, pp. 314\u2013323. ACM Press (1995)","DOI":"10.1145\/224164.224223"},{"key":"14_CR27","doi-asserted-by":"crossref","unstructured":"Chitil, O.: Type inference builds a short cut to deforestation. In: Proceedings of the 4th ACM SIGPLAN International Conference on Functional Programming, ICFP 1999, pp. 249\u2013260. ACM Press (1999)","DOI":"10.1145\/317765.317907"},{"key":"14_CR28","unstructured":"Yokoyama, T., Hu, Z., Takeichi, M.: Calculation rules for warming-up in fusion transformation. In: The 2005 Symposium on Trends in Functional Programming, TFP 2005, pp. 399\u2013412 (2005)"},{"issue":"6","key":"14_CR29","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1017\/S0956796899003536","volume":"9","author":"A Geser","year":"1999","unstructured":"Geser, A., Gorlatch, S.: Parallelizing functional programs by generalization. J. Funct. Program. 9(6), 649\u2013673 (1999)","journal-title":"J. Funct. Program."},{"key":"14_CR30","doi-asserted-by":"crossref","unstructured":"Morita, K., Morihata, A., Matsuzaki, K., Hu, Z., Takeichi, M.: Automatic inversion generates divide-and-conquer parallel programs. In: Proceedings of the ACM SIGPLAN 2007 Conference on Programming Language Design and Implementation, pp. 146\u2013155. ACM Press (2007)","DOI":"10.1145\/1250734.1250752"},{"key":"14_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1007\/3540543961_7","volume-title":"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: Hughes, J. (ed.) FPCA 1991. Lecture Notes in Computer Science, vol. 523, pp. 124\u2013144. Springer, Heidelberg (1991)"},{"issue":"11","key":"14_CR32","doi-asserted-by":"publisher","first-page":"2108","DOI":"10.1016\/j.scico.2012.07.011","volume":"78","author":"R Hinze","year":"2013","unstructured":"Hinze, R.: Adjoint folds and unfolds - an extended study. Sci. Comput. Program. 78(11), 2108\u20132159 (2013)","journal-title":"Sci. Comput. Program."},{"key":"14_CR33","doi-asserted-by":"crossref","unstructured":"Hinze, R., Wu, N., Gibbons, J.: Conjugate hylomorphisms - or: the mother of all structured recursion schemes. In: Proceedings of the 42nd Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2015, pp. 527\u2013538. ACM Press (2015)","DOI":"10.1145\/2775051.2676989"}],"container-title":["Lecture Notes in Computer Science","Functional and Logic Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-29604-3_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T11:00:37Z","timestamp":1559386837000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-29604-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319296036","9783319296043"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-29604-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}