{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:28:16Z","timestamp":1742916496475,"version":"3.40.3"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319452784"},{"type":"electronic","value":"9783319452791"}],"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-45279-1_5","type":"book-chapter","created":{"date-parts":[[2016,9,16]],"date-time":"2016-09-16T16:23:45Z","timestamp":1474043025000},"page":"62-77","source":"Crossref","is-referenced-by-count":3,"title":["Purely Functional Incremental Computing"],"prefix":"10.1007","author":[{"given":"Denis","family":"Firsov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wolfgang","family":"Jeltsch","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,9,17]]},"reference":[{"key":"5_CR1","unstructured":"Acar, U.A.: Self-adjusting computation. Ph.D. thesis, Carnegie Mellon University, Pittsburgh, Pennsylvania, May 2005"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Acar, U.A., Blelloch, G., Ley-Wild, R., Tangwongsan, K., Turkoglu, D.: Traceable data types for self-adjusting computation. In: Proceedings of the 31st ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2010), pp. 483\u2013496. ACM, New York (2010)","DOI":"10.1145\/1806596.1806650"},{"key":"5_CR3","doi-asserted-by":"crossref","unstructured":"Cai, Y., Giarrusso, P.G., Rendel, T., Ostermann, K.: A theory of changes for higher-order languages: incrementalizing $$\\lambda $$ -calculi by static differentiation. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 145\u2013155. ACM, New York (2014)","DOI":"10.1145\/2666356.2594304"},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"Carlsson, M.: Monads for incremental computing. In: Proceedings of the Seventh ACM SIGPLAN International Conference on Functional Programming, pp. 26\u201335. ACM, New York (2002)","DOI":"10.1145\/581478.581482"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Dietz, P.F., Sleator, D.D.: Two algorithms for maintaining order in a list. Technical report CMU-CS-88-113, Carnegie Mellon University, Pittsburgh, Pennsylvania (1988)","DOI":"10.1145\/28395.28434"},{"key":"5_CR6","unstructured":"Firsov, D., Jeltsch, W.: incremental-computing-0.0.0.0, Haskell Cabal package, Feburary 2015. http:\/\/hackage.haskell.org\/package\/incremental-computing-0.0.0.0"},{"key":"5_CR7","unstructured":"Firsov, D., Jeltsch, W.: order-maintenance-0.1.1.0, Haskell Cabal package, November 2015. http:\/\/hackage.haskell.org\/package\/order-maintenance-0.1.1.0"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Hammer, M.A., Phang, K.Y., Hicks, M., Foster, J.S.: Adapton: composable, demand-driven incremental computation. In: Proceedings of the 35th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI 2014), pp. 156\u2013166. ACM, New York (2014)","DOI":"10.1145\/2666356.2594324"},{"issue":"4","key":"5_CR9","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01018827","volume":"8","author":"J Launchbury","year":"1995","unstructured":"Launchbury, J., Peyton Jones, S.: State in Haskell. LISP Symbol. Comput. 8(4), 293\u2013341 (1995)","journal-title":"LISP Symbol. Comput."},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"707","DOI":"10.1007\/978-3-642-39038-8_29","volume-title":"ECOOP 2013 \u2013 Object-Oriented Programming","author":"I Maier","year":"2013","unstructured":"Maier, I., Odersky, M.: Higher-order reactive programming with incremental lists. In: Castagna, G. (ed.) ECOOP 2013. LNCS, vol. 7920, pp. 707\u2013731. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Programming Languages"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45279-1_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,13]],"date-time":"2019-09-13T13:06:45Z","timestamp":1568380005000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-45279-1_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319452784","9783319452791"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45279-1_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}