{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:09:56Z","timestamp":1725664196210},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_56","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:13Z","timestamp":1330255693000},"page":"423-431","source":"Crossref","is-referenced-by-count":0,"title":["Fast strictness analysis via symbolic fixpoint iteration"],"prefix":"10.1007","author":[{"given":"Charles","family":"Consel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"key":"27_CR1","unstructured":"S. Abramsky and C. Hankin, editors. Abstract Interpretation of Declarative Languages. Ellis Horwood, 1987."},{"key":"27_CR2","unstructured":"A. D. Aho, R. Sethi, and J. D. Ullman. Compilers: Principles, Techniques and Tools. Addison-Wesley, 1986."},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"J. M. Ashley and C. Consel. Fixpoint computation for polyvariant static analyses of higher-order applicative programs. ACM Transactions on Programming Languages and Systems, 1994. To appear.","DOI":"10.1145\/186025.186037"},{"key":"27_CR4","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF01806169","volume":"1","author":"A. Bloss","year":"1988","unstructured":"A. Bloss, P. Hudak, and J. Young. Code optimizations for lazy evaluation. Lisp and Symbolic Computation, 1:147\u2013164, 1988.","journal-title":"Lisp and Symbolic Computation"},{"issue":"1","key":"27_CR5","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/321992.321996","volume":"24","author":"R. M. Burstall","year":"1977","unstructured":"R. M. Burstall, and J. Darlington. A transformational system for developing recursive programs. Journal of ACM, 24(1):44\u201367, 1977.","journal-title":"Journal of ACM"},{"key":"27_CR6","volume-title":"PhD thesis","author":"W. N. Chin","year":"1990","unstructured":"W. N. Chin. Automatic Methods for Program Transformation. PhD thesis, University of London, Imperial College of Science, Technology and Medecine, London, UK, 1990."},{"key":"27_CR7","doi-asserted-by":"crossref","unstructured":"T-R. Chuang and B. Goldberg. A syntactic approach to fixed point computation on finite domains. In ACM Conference on Lisp and Functional Programming, pages 109\u2013118, 1992.","DOI":"10.1145\/141471.141517"},{"key":"27_CR8","doi-asserted-by":"crossref","unstructured":"C. Hankin and D. Le M\u00e9tayer. Deriving algorithms from type inference systems: application to strictness analysis. In ACM Symposium on Principles of Programming Languages, pages 202\u2013212, 1994.","DOI":"10.1145\/174675.177858"},{"key":"27_CR9","doi-asserted-by":"crossref","unstructured":"P. Hudak and J. Young. Higher-order strictness analysis in untyped lambda calculus. In ACM Symposium on Principles of Programming Languages, pages 97\u2013109, 1986.","DOI":"10.1145\/512644.512653"},{"key":"27_CR10","doi-asserted-by":"crossref","unstructured":"N. D. Jones and A. Mycroft. Data flow analysis of applicative programs using minimal function graphs. In ACM Symposium on Principles of Programming Languages, 1986.","DOI":"10.1145\/512644.512672"},{"key":"27_CR11","doi-asserted-by":"crossref","unstructured":"S. L. Peyton Jones and Jon Salkild. The spineless tagless G-machine. In FPCA'89, 4th International Conference on Functional Programming Languages and Computer Architecture, pages 184\u2013201, 1989.","DOI":"10.1145\/99370.99385"},{"key":"27_CR12","doi-asserted-by":"crossref","unstructured":"P. Wadler and R. J. M. Hughes. Projections for strictness analysis. In FPCA'87, 2th International Conference on Functional Programming Languages and Computer Architecture, 1987.","DOI":"10.1007\/3-540-18317-5_21"},{"key":"27_CR13","volume-title":"Technical Report YALEU\/DCS\/RR-505","author":"J. Young","year":"1986","unstructured":"J. Young, and P. Hudak. Finding Fixpoints on Function Spaces. Technical Report YALEU\/DCS\/RR-505, Yale University, New Haven, Connecticut, USA, 1986."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_56.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:25Z","timestamp":1605630145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_56"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_56","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}