{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T03:12:24Z","timestamp":1767928344995,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642157684","type":"print"},{"value":"9783642157691","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15769-1_27","type":"book-chapter","created":{"date-parts":[[2010,9,13]],"date-time":"2010-09-13T06:09:40Z","timestamp":1284358180000},"page":"439-454","source":"Crossref","is-referenced-by-count":2,"title":["Strictness Meets Data Flow"],"prefix":"10.1007","author":[{"given":"Tom","family":"Schrijvers","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mycroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1596638.1596640","volume-title":"Haskell 2009: Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell","author":"M.C. Bolingbroke","year":"2009","unstructured":"Bolingbroke, M.C., Peyton Jones, S.L.: Types are calling conventions. In: Haskell 2009: Proceedings of the 2nd ACM SIGPLAN Symposium on Haskell, pp. 1\u201312. ACM, New York (2009)"},{"key":"27_CR2","first-page":"42","volume-title":"On Programs as Data Objects","author":"G.L. Burn","year":"1985","unstructured":"Burn, G.L., Hankin, C.L., Abramsky, S.: The theory of strictness analysis for higher order functions. In: On Programs as Data Objects, New York, NY, USA, pp. 42\u201362. Springer, Heidelberg (1985)"},{"issue":"3","key":"27_CR3","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1145\/356674.356676","volume":"8","author":"L.D. Fosdick","year":"1976","unstructured":"Fosdick, L.D., Osterweil, L.J.: Data flow analysis in software reliability. ACM Comput. Surv.\u00a08(3), 305\u2013330 (1976)","journal-title":"ACM Comput. Surv."},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1145\/268946.268964","volume-title":"POPL 1998: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"T.P. Jensen","year":"1998","unstructured":"Jensen, T.P.: Inference of polymorphic and conditional strictness properties. In: POPL 1998: Proceedings of the 25th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 209\u2013221. ACM, New York (1998)"},{"key":"27_CR5","unstructured":"Peyton Jones, S. (ed.): Haskell 98 Language and Libraries \u2013 The Revised Report (2003)"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1145\/158511.158618","volume-title":"POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","author":"J. Launchbury","year":"1993","unstructured":"Launchbury, J.: A natural semantics for lazy evaluation. In: POPL 1993: Proceedings of the 20th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 144\u2013154. ACM, New York (1993)"},{"key":"27_CR7","unstructured":"Mycroft, A.: Abstract interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh (1981)"},{"key":"27_CR8","unstructured":"Wadler, P.: Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In: Abstract Interpretation. Ellis Horwood (1987)"},{"key":"27_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/3-540-18317-5_21","volume-title":"Functional Programming Languages and Computer Architecture","author":"P. Wadler","year":"1987","unstructured":"Wadler, P., Hughes, R.J.M.: Projections for strictness analysis. In: Kahn, G. (ed.) FPCA 1987. LNCS, vol.\u00a0274, pp. 385\u2013407. Springer, Heidelberg (1987)"},{"key":"27_CR10","unstructured":"Wansbrough, K.: Simple polymorphic usage analysis. Technical Report UCAM-CL-TR-623, Cambridge University Computer Laboratory (March 2005)"}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15769-1_27.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T12:17:35Z","timestamp":1619785055000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15769-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157684","9783642157691"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15769-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}