{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:18:31Z","timestamp":1742617111030,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540543961"},{"type":"electronic","value":"9783540475996"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540543961_11","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:43:22Z","timestamp":1330209802000},"page":"215-240","source":"Crossref","is-referenced-by-count":6,"title":["Linearity and laziness"],"prefix":"10.1007","author":[{"given":"David","family":"Wakeling","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Colin","family":"Runciman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"key":"11_CR1","unstructured":"L. Augustsson. Compiling Lazy Functional Languages, Part II. PhD thesis, Chalmers University of Technology, S-412 96 G\u00f6teborg, November 1987."},{"key":"11_CR2","unstructured":"L. Augustsson and T. Johnsson. Lazy ML Users Manual, July 1989. (Distributed with the LML compiler, version 0.95)."},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"A. Bloss. Update analysis and the efficient implementation of functional aggregates. In Proceedings of the 1989 Conference on Functional Programming Languages and Computer Architecture, pages 26\u201338. ACM Press, September 1989.","DOI":"10.1145\/99370.99373"},{"key":"11_CR4","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1016\/0167-6423(87)90020-7","volume":"8","author":"G. Cousineau","year":"1987","unstructured":"G. Cousineau, P.-L. Curien, and M. Mauny. The categorical abstract machine. Science of Computer Programming, 8:173\u2013202, 1987.","journal-title":"Science of Computer Programming"},{"key":"11_CR5","doi-asserted-by":"crossref","unstructured":"J. Fairbairn and S. Wray. TIM: A simple, lazy abstract machine to execute supercombinators. In Proceedings of the 1987 Conference on Functional Programming Languages and Computer Architecture, pages 34\u201345. Springer-Verlag, September 1987. LNCS 274.","DOI":"10.1007\/3-540-18317-5_3"},{"issue":"11","key":"11_CR6","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1145\/363269.363280","volume":"12","author":"R. R. Fenichel","year":"1969","unstructured":"R. R. Fenichel and J. C. Yochelson. A LISP garbage-collector for virtual-memory computer systems. CACM, 12(11):611\u2013612, November 1969.","journal-title":"CACM"},{"issue":"1","key":"11_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(87)90045-4","volume":"50","author":"J.-Y. Girard","year":"1987","unstructured":"J.-Y. Girard. Linear logic. Theoretical Computer Science, 50(1):1\u2013101, 1987.","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"J.-Y. Girard and Y. Lafont. Linear logic and lazy computation. In Proceedings of the International Joint Conference on Theory and Practice of Software Development (TAPSOFT'87), pages 52\u201366. Springer-Verlag, March 1987. LNCS 250.","DOI":"10.1007\/BFb0014972"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"J. C. Guzm\u00e1n and P. Hudak. Single-threaded polymorphic lambda calculus. In Proceedings of the Fifth Annual IEEE Symposium on Logic In Computer Science, pages 333\u2013343, June 1990.","DOI":"10.1109\/LICS.1990.113759"},{"key":"11_CR10","unstructured":"S. Holmstr\u00f6m. A simple and efficient way to handle large data structures in applicative languages. In Proceedings of the SERC\/Chalmers Workshop on Declarative Programming, pages 185\u2013187. University College London, April 1983."},{"key":"11_CR11","unstructured":"S. Holmstr\u00f6m. A linear functional language. In Proceedings of the Workshop on the Implementation of Lazy Functional Languages, Aspen\u00e4es, pages 13\u201332, September 1988. Report 53, Programming Methodology Group, Chalmers University of Technology, S-412 96 G\u00f6teborg."},{"key":"11_CR12","unstructured":"S. Holmstr\u00f6m. Quicksort in a linear functional language. PMG Memo. 65, Chalmers University of Technology, S-412 96 G\u00f6teborg, January 1989."},{"key":"11_CR13","unstructured":"P. Hudak. A semantic model of reference counting and its abstraction. In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 45\u201362. Ellis Horwood, 1987."},{"key":"11_CR14","unstructured":"P. Hudak and P. Wadler (editors). Report on the programming language Haskell, a non-strict purely functional language (Version 1.0). Technical report, University of Glasgow, Department of Computer Science, April 1990."},{"key":"11_CR15","unstructured":"T. Johnsson. Compiling Lazy Functional Languages. PhD thesis, Chalmers University of Technology, S-412 96 G\u00f6teborg, February 1987."},{"key":"11_CR16","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1016\/0304-3975(88)90100-4","volume":"59","author":"Y. Lafont","year":"1988","unstructured":"Y. Lafont. The linear abstract machine. Theoretical Computer Science, 59:157\u2013180, 1988.","journal-title":"Theoretical Computer Science"},{"key":"11_CR17","unstructured":"Y. Lafont. Logiques, Cat\u00e9gories et machines. PhD thesis, Universit\u00e9 de Paris 7, 1988."},{"issue":"4","key":"11_CR18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","volume":"6","author":"P. J. Landin","year":"1964","unstructured":"P. J. Landin. The mechanical evaluation of expressions. Computer Journal, 6(4):308\u2013320, 1964.","journal-title":"Computer Journal"},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"B. B. Mandelbrot. The Fractal Geometry of Nature. W. H. Freeman, 1983.","DOI":"10.1119\/1.13295"},{"issue":"3","key":"11_CR20","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A theory of type polymorphism in programming. Journal of Computer and System Sciences, 17(3):348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"key":"11_CR21","unstructured":"S. L. Peyton Jones. The Implementation of Functional Programming Languages. Prentice-Hall, 1987."},{"key":"11_CR22","doi-asserted-by":"crossref","unstructured":"S. L. Peyton Jones and J. Salkild. The Spineless Tagless G-machine. In Proceedings of the 1989 Conference on Functional Programming Languages and Computer Architecture, pages 184\u2013201. ACM Press, September 1989.","DOI":"10.1145\/99370.99385"},{"issue":"2","key":"11_CR23","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1145\/3318.3323","volume":"7","author":"D. A. Schmidt","year":"1985","unstructured":"D. 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":"1","key":"11_CR24","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","volume":"9","author":"D. A. Turner","year":"1979","unstructured":"D. A. Turner. A new implementation technique for applicative languages. SOFTWARE \u2014 Practice and Experience, 9(1):31\u201350, January 1979.","journal-title":"SOFTWARE \u2014 Practice and Experience"},{"key":"11_CR25","unstructured":"P. Wadler. Is there a use for linear logic? Technical report, Department of Computing Science, University of Glasgow, December 1990."},{"key":"11_CR26","unstructured":"P. Wadler. Linear types can change the world! In IFIP Working Conference on Programming Concepts and Methods, Sea of Gallilee, Israel, April 1990."},{"key":"11_CR27","unstructured":"P. Wadler. Private communication, February 1990."},{"key":"11_CR28","unstructured":"D. Wakeling. Linearity and laziness. DPhil thesis, Department of Computer Science, University of York, November 1990. Technical Report YCST 90\/07."}],"container-title":["Lecture Notes in Computer Science","Functional Programming Languages and Computer Architecture"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540543961_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:17:08Z","timestamp":1742591828000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540543961_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540543961","9783540475996"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3540543961_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}