{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,6]],"date-time":"2025-01-06T05:09:21Z","timestamp":1736140161420,"version":"3.32.0"},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"354017611X"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0014978","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T06:02:53Z","timestamp":1132725773000},"page":"140-154","source":"Crossref","is-referenced-by-count":4,"title":["Generating efficient code from strictness annotations"],"prefix":"10.1007","author":[{"given":"Gary","family":"Lindstrom","sequence":"first","affiliation":[]},{"given":"Lal","family":"George","sequence":"additional","affiliation":[]},{"given":"Dowming","family":"Yeh","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Burn, G. L., C. L. Hankin, and S. Abramsky. Theory and practice of strictness analysis for higher order functions. April 1985. Dept. of Computing, Imperial College of Science and Technology.","DOI":"10.1016\/0167-6423(86)90010-9"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"Clocksin, W.F. and Mellish, C.S. Programming in Prolog. Springer-Verlag, 1984. 2nd Edition.","DOI":"10.1007\/978-3-642-96873-0"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"Fairbairn, Jon, and Stuart C. Wray. Code generation techniques for functional languages. In Proc. Symp. on Lisp and Func. Pgmming., pages 94\u2013104. ACM, 1986.","DOI":"10.1145\/319838.319853"},{"key":"10_CR4","volume-title":"Proc. Workshop on Implementations of Functional Languages","author":"P. Hudak","year":"1985","unstructured":"Hudak, P., and J. Young. A set-theoretic characterization of function strictness in the lambda calculus. In Proc. Workshop on Implementations of Functional Languages. Chalmers Univ., Aspenas, Sweden, February, 1985."},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Hughes, R. J. M. Super Combinators. In Lisp and Functional Programming Conference, pages 1\u201310. ACM, 1982.","DOI":"10.1145\/800068.802129"},{"key":"10_CR6","unstructured":"Hughes, J. Strictness detection in non-flat domains. Programming Research Group, Oxford."},{"key":"10_CR7","volume-title":"Proc. Symp. on Compiler Const","author":"T. Johnsson","year":"1984","unstructured":"Johnsson, T. Efficient compilation of lazy evaluation. In Proc. Symp. on Compiler Const. ACM SIGPLAN, Montreal, 1984."},{"key":"10_CR8","unstructured":"Kieburtz, R. B., and M. Napierala. A studied laziness \u2014 strictness analysis with structured data types. 1985. Extended abstract, Oregon Graduate Center."},{"key":"10_CR9","volume-title":"Software Series: The C Programming Language","author":"B.W. Kernighan","year":"1978","unstructured":"Kernighan, B.W. and Ritchie, D.M. Software Series: The C Programming Language. Prentice-Hall, Englewood Cliffs, New Jersey 07632, 1978."},{"key":"10_CR10","unstructured":"Kieburtz, R. B. Abstract interpretations over infinite domains cannot terminate uniformly. February 17, 1986. Unpublished note, Dept. of Computer Science, Oregon Graduate Center."},{"key":"10_CR11","volume-title":"Proc. Symp. on Princ. of Pgmming. Lang.","author":"T.-M. Kuo","year":"1987","unstructured":"Kuo, T.-M., and P. Mishra. On Strictness and its Analysis. In Proc. Symp. on Princ. of Pgmming. Lang.. ACM, Munich, West Germany, March, 1987. To appear."},{"key":"10_CR12","first-page":"196","volume-title":"Proc. Symposium on Compiler Construction","author":"G. Lindstrom","year":"1986","unstructured":"Lindstrom, Gary. Static evaluation of functional programs. In Proc. Symposium on Compiler Construction, pages 196\u2013206. ACM SIGPLAN, Palo Alto, CA, June, 1986."},{"key":"10_CR13","unstructured":"Lindstrom, Gary, Lal George and Dowming Yeh. Optimized compilation of functional programs through strictness analysis. August 4, 1986. Technical summary."},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"Mycroft, A. The theory and practice of transforming call-by-need into call-by-value. In Int. Symp. on Prgmming. Springer, April, 1980. Lecture Notes in Computer Science, vol. 83.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"10_CR15","doi-asserted-by":"crossref","first-page":"220","DOI":"10.1007\/3-540-15975-4_39","volume":"201","author":"M. Sheeran","year":"1985","unstructured":"Sheeran, Mary. Designing regular array architectures using higher order functions. In Proc. Conf. on Functional Programming Languages and Computer Architectures, pages 220\u2013237. Springer Verlag, 1985. Lecture Notes in Computer Science, vol. 201.","journal-title":"Proc. Conf. on Functional Programming Languages and Computer Architectures"},{"key":"10_CR16","unstructured":"Wadler, Phil. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). November 10, 1985. Unpublished note, Programming Research Group, Oxford Univ."},{"key":"10_CR17","unstructured":"Warren, David H. D. Applied logic: its use and implementation as a programming tool. Technical Report, SRI, Inc., 1983. Note 290."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '87"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/BFb0014978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,5]],"date-time":"2025-01-05T21:27:28Z","timestamp":1736112448000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["354017611X"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0014978","relation":{},"subject":[]}}