{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:07:41Z","timestamp":1725487661436},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540657651"},{"type":"electronic","value":"9783540489580"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48958-4_14","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T22:11:42Z","timestamp":1185142302000},"page":"255-270","source":"Crossref","is-referenced-by-count":0,"title":["Strictness Analysis as Finite-Domain Constraint Solving"],"prefix":"10.1007","author":[{"given":"Tihomir","family":"Gabri\u0107","sequence":"first","affiliation":[]},{"given":"Kevin","family":"Glynn","sequence":"additional","affiliation":[]},{"given":"Harald","family":"S\u00f8ndergaard","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[1999,4,30]]},"reference":[{"key":"14_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/3-540-57186-8_72","volume-title":"Programming Language Implementation and Logic Programming","author":"M.-M. Corsini","year":"1993","unstructured":"M.-M. Corsini, K. Musumbu, A. Rauzy, and B. Le Charlier. Efficient bottom-up abstract interpretation of Prolog by means of constraint solving over symbolic finite domains. In M. Bruynooghe and J. Penjam, editors, Programming Language Implementation and Logic Programming, LNCS 714, pages 75\u201391. Springer-Verlag, 1993."},{"key":"14_CR2","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot. Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages. In Proc. 1994 Int. Conf. Computer Languages, pages 95\u2013112. IEEE Computer Society, 1994.","DOI":"10.1109\/ICCL.1994.288389"},{"key":"14_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1007\/3540543961_22","volume-title":"Functional Programming Languages and Computer Architecture","author":"F. Henglein","year":"1991","unstructured":"F. Henglein. Efficient type inference for higher-order binding-time analysis. In J. Hughes, editor, Functional Programming Languages and Computer Architecture, LNCS 523, pages 448\u2013472. Springer-Verlag, 1991."},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"T. P. Jensen. Disjunctive strictness analysis. In Proc. Seventh Ann. IEEE Symp. Logic in Computer Science, pages 174\u2013185, 1992.","DOI":"10.1109\/LICS.1992.185531"},{"key":"14_CR5","unstructured":"J. M. Kewley and K. Glynn. Evaluation annotations for Hope+. Functional Programming: Proc. 1989 Glasgow Workshop, pages 329\u2013337. Springer-Verlag, 1990."},{"key":"14_CR6","series-title":"PhD thesis","volume-title":"Abstract Interpretation and Optimising Transformations for Applicative Programs","author":"A. Mycroft","year":"1981","unstructured":"A. Mycroft. Abstract Interpretation and Optimising Transformations for Applicative Programs. PhD thesis, University of Edinburgh, Scotland, 1981."},{"key":"14_CR7","unstructured":"R. Plasmeijer and M. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993."},{"issue":"6","key":"14_CR8","doi-asserted-by":"publisher","first-page":"896","DOI":"10.1145\/218570.218573","volume":"17","author":"R. Sekar","year":"1995","unstructured":"R. Sekar and I. V. Ramakrishnan. Fast strictness analysis based on demand propagation. ACM Trans. Programming Languages and Systems, 17(6):896\u2013937, 1995.","journal-title":"ACM Trans. Programming Languages and Systems"},{"key":"14_CR9","unstructured":"Martin Sulzmann, Martin Odersky, and Martin Wehr. Type inference with constrained types (extended abstract). In B. Pierce, editor, Proc. Fourth Int. Workshop Foundations of Object-Oriented Languages, 1997. \n                  http:\/\/www.cs.indiana.edu\/hyplan\/pierce\/fool\n                  \n                ."},{"key":"14_CR10","unstructured":"P. Wadler. Strictness analysis on non-flat domains (by abstract interpretation over finite domains). In S. Abramsky and C. Hankin, editors, Abstract Interpretation of Declarative Languages, pages 266\u2013275. Ellis Horwood, 1987."},{"key":"14_CR11","unstructured":"D. A. Wright. Linear, strictness and usage logics. In M. Houle and P. Eades, editors, Proc. CATS\u201996, Australian Computer Science Communications 18(3), pages 73\u201380, 1996."}],"container-title":["Lecture Notes in Computer Science","Logic-Based Program Synthesis and Transformation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48958-4_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T08:30:10Z","timestamp":1548318610000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-48958-4_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540657651","9783540489580"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-48958-4_14","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}