{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:40:10Z","timestamp":1738820410307,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540938996"},{"type":"electronic","value":"9783540939009"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-93900-9_8","type":"book-chapter","created":{"date-parts":[[2008,12,15]],"date-time":"2008-12-15T09:35:59Z","timestamp":1229333759000},"page":"44-58","source":"Crossref","is-referenced-by-count":1,"title":["The Higher-Order Aggregate Update Problem"],"prefix":"10.1007","author":[{"given":"Christos","family":"Dimoulas","sequence":"first","affiliation":[]},{"given":"Mitchell","family":"Wand","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"8_CR1","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0304-3975(93)90110-F","volume":"118","author":"M. Draghicescu","year":"1993","unstructured":"Draghicescu, M., Purushothaman, S.: A uniform treatment of order of evaluation and aggregate update. Theoretical Computer Science\u00a0118(2), 231\u2013262 (1993)","journal-title":"Theoretical Computer Science"},{"key":"8_CR2","doi-asserted-by":"crossref","unstructured":"Felleisen, M., Friedman, D.P.: A calculus for assignments in higher-order languages. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, p. 314 (1987)","DOI":"10.1145\/41625.41654"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Guzman, J.C., Hudak, P.: Single-threaded polymorphic lambda calculus. In: IEEE Symposium on Logic in Computer Science, pp. 333\u2013343 (1990)","DOI":"10.1109\/LICS.1990.113759"},{"key":"8_CR4","doi-asserted-by":"crossref","unstructured":"Hudak, P., Bloss, A.: The aggregate update problem in functional programming systems. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 300\u2013314 (1985)","DOI":"10.1145\/318593.318660"},{"key":"8_CR5","doi-asserted-by":"crossref","unstructured":"Hudak, P., Bloss, A.: Avoiding copying in functional and logic programming languages. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 300\u2013314 (1985)","DOI":"10.1145\/318593.318660"},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Odersky, M.: How to make destructive updates less destructive. In: ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 25\u201326 (1991)","DOI":"10.1145\/99583.99590"},{"key":"8_CR7","unstructured":"Sastry, A.V.S.: Efficient Array Update Analysis of Strict Functional Languages. PhD thesis, Computer and Information Science, University of Oregon (1994)"},{"key":"8_CR8","doi-asserted-by":"crossref","unstructured":"Sastry, A.V.S., Clinger, W.D., Ariola, Z.: Order-of-evaluation analysis for destructive updates in strict functional languages with flat aggregates. In: Conference on Functional Programming Languages and Computer Architecture, pp. 266\u2013275 (1993)","DOI":"10.1145\/165180.165222"},{"key":"8_CR9","doi-asserted-by":"crossref","unstructured":"Shankar, N.: Static analysis for safe destructive updates in a functional language. In: International Workshop on Logic-based Program Synthesis and Transformation, pp. 1\u201324 (2002)","DOI":"10.1007\/3-540-45607-4_1"},{"key":"8_CR10","unstructured":"Shivers, O.: Control-Flow Analysis of Higher-Order Languages, or Taming Lambda. PhD thesis, School of Computer Science, Carnegie Mellon University, Pittsburgh, Pennsylvania, Technical Report CMU-CS-91-145 (1991)"},{"key":"8_CR11","doi-asserted-by":"crossref","unstructured":"Wadler, P.: Linear types can change the world! In: IFIP TC 2 Working Conference on Programming Concepts and Methods, pp. 347\u2013359 (1990)","DOI":"10.1145\/99370.99404"},{"issue":"3","key":"8_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1017\/S0956796801003938","volume":"11","author":"M. Wand","year":"2001","unstructured":"Wand, M., Clinger, W.D.: Set constraints for destructive array update optimization. Journal of Functional Programming\u00a011(3), 319\u2013346 (2001)","journal-title":"Journal of Functional Programming"},{"key":"8_CR13","unstructured":"Williamson, G.B.: Flow analysis for higher-order multithreaded computations. PhD thesis, College of Computer and Information Science, Northeastern University, Boston, Massachusetts (2004)"}],"container-title":["Lecture Notes in Computer Science","Verification, Model Checking, and Abstract Interpretation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-93900-9_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,6]],"date-time":"2025-02-06T05:20:01Z","timestamp":1738819201000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-93900-9_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540938996","9783540939009"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-93900-9_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}