{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T12:05:42Z","timestamp":1770293142194,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540552536","type":"print"},{"value":"9783540468035","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1992]]},"DOI":"10.1007\/3-540-55253-7_7","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T09:57:25Z","timestamp":1330250245000},"page":"110-129","source":"Crossref","is-referenced-by-count":1,"title":["Fully persistent arrays for efficient incremental updates and voluminous reads"],"prefix":"10.1007","author":[{"given":"Tyng-Ruey","family":"Chuang","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,30]]},"reference":[{"key":"7_CR1","unstructured":"12th Annual ACM Symposium on Principles of Programming Languages. A.C.M., January 1985. New Orleans, Louisiana, U.S.A."},{"key":"7_CR2","unstructured":"Functional Programming Languages and Computer Architecture. A.C.M.\/Addison-Wesley, September 1989. Imperial College, London, U.K."},{"key":"7_CR3","unstructured":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming. A.C.M., June 1990. Nice, France."},{"key":"7_CR4","unstructured":"18th Annual ACM Symposium on Principles of Programming Languages. A.C.M., January 1991. Orlando, Florida, U.S.A."},{"key":"7_CR5","unstructured":"Proceedings of the Symposium on Partial Evaluation and and Semantics-Based Program Manipulation. A.C.M., June 1991. New Haven, Connecticut, U.S.A. Also appears as SIG-PLAN Notices, 26(9), September 1991."},{"issue":"3","key":"7_CR6","doi-asserted-by":"crossref","first-page":"490","DOI":"10.1007\/BF01941130","volume":"28","author":"A. Aasa","year":"1988","unstructured":"Annika Aasa, S\u00f6ren Holmstr\u00f6m, and Christina Nilsson. An efficiency comparison of some representations of purely functional arrays. BIT, 28(3):490\u2013503, 1988.","journal-title":"BIT"},{"issue":"7","key":"7_CR7","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1145\/359545.359566","volume":"21","author":"Henry G. G. Baker Jr.","year":"1978","unstructured":"Henry G. Baker, Jr. Shallow binding in Lisp 1.5. Communications of the ACM, 21(7):565\u2013569, July 1978.","journal-title":"Communications of the ACM"},{"issue":"8","key":"7_CR8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1145\/122598.122614","volume":"26","author":"Henry G. G. Baker","year":"1991","unstructured":"Henry G. Baker. Shallow binding makes functional arrays fast. SIGPLAN Notices, 26(8):145\u2013147, August 1991.","journal-title":"SIGPLAN Notices"},{"key":"7_CR9","unstructured":"Adrienne Gael Bloss. Path Analysis and the Optimization of Non-Strict Functional Languages. PhD thesis, Department of Computer Science, Yale University, May 1989. Also appears as report YALEU\/DCS\/RR-704."},{"key":"7_CR10","doi-asserted-by":"crossref","unstructured":"Adrienne Bloss. Update analysis and the efficient implementation of functional aggregates. pages 26\u201338. In [2]","DOI":"10.1145\/99370.99373"},{"key":"7_CR11","series-title":"Lecture Notes in Computer Science, Volume 382","volume-title":"Algorithms and Data Structures","year":"1989","unstructured":"Frank Dehne, J\u00f6rg-R\u00fcdiger Sack, and Nicola Santoro, editors. Algorithms and Data Structures. Ottawa, Canada, August 1989. Lecture Notes in Computer Science, Volume 382, Springer-Verlag."},{"key":"7_CR12","series-title":"Lecture Notes in Computer Science, Volume 382","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/3-540-51542-9_8","volume-title":"Algorithms and Data Structures","author":"Paul F. F. Dietz","year":"1989","unstructured":"Paul F. Dietz. Fully persistent arrays. pages 67\u201374. In [11]."},{"issue":"1","key":"7_CR13","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"James R. R. Driscoll","year":"1989","unstructured":"James R. Driscoll, Neil Sarnak, Daniel D. Sleator, and Robert E. Tarjan. Making data structures persistent. Journal of Computer and System Sciences, 38(1):86\u2013124, February 1989.","journal-title":"Journal of Computer and System Sciences"},{"key":"7_CR14","doi-asserted-by":"crossref","unstructured":"Juan C. Guzm\u00e1n and Paul Hudak. Single-threaded polymorphic lambda calculus. In Proceedings of 5th Annual IEEE Symposium on Logic in Computer Science, pages 333\u2013343. I.E.E.E., June 1990.","DOI":"10.1109\/LICS.1990.113759"},{"key":"7_CR15","volume-title":"Proceedings of the SERC Chalmers Workshop on Declarative Programming Languages","author":"S. Holmstr\u00f6m","year":"1983","unstructured":"S\u00f6ren Holmstr\u00f6m. How to handle large data structures in functional languages. In Proceedings of the SERC Chalmers Workshop on Declarative Programming Languages. University College London, 1983."},{"key":"7_CR16","first-page":"300","volume-title":"12th Annual ACM Symposium on Principles of Programming Languages","author":"P. Hudak","year":"1985","unstructured":"Paul Hudak and Adrienne Bloss. The aggregate update problem in functional programming systems. pages 300\u2013314. In [1]."},{"key":"7_CR17","doi-asserted-by":"crossref","unstructured":"Paul Hudak, Simon Peyton Jones, and Philip Wadler, editors. Report on the Programming Language Haskell \u2014 A Non-Strict, Purely Functional Language, Version 1.1. August 1991. Available from Yale University and University of Glasgow.","DOI":"10.1145\/130697.130699"},{"key":"7_CR18","unstructured":"John Hughes. An efficient implementation of purely functional arrays. Technical report, Department of Computer Sciences, Chalmers University of Technology, 1985."},{"key":"7_CR19","first-page":"25","volume-title":"18th Annual ACM Symposium on Principles of Programming Languages","author":"M. Odersky","year":"1991","unstructured":"Martin Odersky. How to make destructive updates less destructive. pages 25\u201336. In [4]."},{"key":"7_CR20","unstructured":"Paul Walton Purdom, Jr. and Cynthia A. Brown. The Analysis of Algorithms. Holt, Rinehart and Winston, 1985."},{"issue":"2","key":"7_CR21","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/3318.3323","volume":"7","author":"David A. A. Schmidt","year":"1985","unstructured":"David A. Schmidt. Detecting global variables in denotational specifications. ACM Transactions on Programming Languages and Systems, 7(2):299\u2013310, April 1985.","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"2","key":"7_CR22","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0096-0551(75)90015-6","volume":"1","author":"J. T. Schwartz","year":"1975","unstructured":"J. T. Schwartz. Optimization of very high level languages \u2014 i. value transmission and its corollaries. Computer Languages, 1(2):161\u2013194, June 1975.","journal-title":"Computer Languages"},{"issue":"3","key":"7_CR23","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1016\/0096-0551(75)90031-4","volume":"1","author":"J. T. Schwartz","year":"1975","unstructured":"J. T. Schwartz. Optimization of very high level languages \u2014 ii. deducing relationships of inclusion and membership. Computer Languages, 1(3):197\u2013218, September 1975.","journal-title":"Computer Languages"},{"issue":"2","key":"7_CR24","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1137\/0606031","volume":"6","author":"R. E. Tarjan","year":"1985","unstructured":"Robert Endre Tarjan. Amortized computational complexity. SIAM Journal on Algebraic and Discrete Methods, 6(2):306\u2013318, April 1985.","journal-title":"SIAM Journal on Algebraic and Discrete Methods"},{"key":"7_CR25","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1145\/91556.91592","volume-title":"Proceedings of the 1990 ACM Conference on Lisp and Functional Programming","author":"P. Wadler","year":"1990","unstructured":"Philip Wadler. Comprehending monads. pages 61\u201378. In [3]."},{"key":"7_CR26","first-page":"255","volume-title":"Proceedings of the Symposium on Partial Evaluation and and Semantics-Based Program Manipulation","author":"P. Wadler","year":"1991","unstructured":"Philip Wadler. Is there a use for linear logic? pages 255\u2013273. In [5], 26(9), September 1991."},{"issue":"1","key":"7_CR27","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/321105.321107","volume":"9","author":"S. Warshall","year":"1962","unstructured":"Stephen Warshall. A theorem on boolean matrices. Journal of the Association for Computing Machinery, 9(1):11\u201312, January 1962.","journal-title":"Journal of the Association for Computing Machinery"}],"container-title":["Lecture Notes in Computer Science","ESOP '92"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-55253-7_7.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:58:32Z","timestamp":1605646712000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-55253-7_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992]]},"ISBN":["9783540552536","9783540468035"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/3-540-55253-7_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992]]}}}