{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:14:14Z","timestamp":1725664454657},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540592938"},{"type":"electronic","value":"9783540492337"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-59293-8_216","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T17:11:52Z","timestamp":1330276312000},"page":"501-515","source":"Crossref","is-referenced-by-count":3,"title":["Strictness and totality analysis with conjunction"],"prefix":"10.1007","author":[{"given":"Kirsten Lackner","family":"Solberg","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","volume":"1","author":"S. Abramsky","year":"1990","unstructured":"Samson Abramsky. Abstract interpretation, logical relations and Kan extensions. Journal of Logic and Computation, 1(1):5\u201339, 1990.","journal-title":"Journal of Logic and Computation"},{"key":"33_CR2","unstructured":"Nick Benton. Strictness Analysis of Functional Programs. PhD thesis, University of Cambridge, 1993. Available as Technical Report No. 309."},{"key":"33_CR3","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"Geoffrey L. Burn, Chris Hankin, and Samson Abramsky. Strictness Analysis for Higher-order Functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"33_CR4","doi-asserted-by":"crossref","unstructured":"Chris Hankin and Daniel Le M\u00e9tayer. Deriving algorithms from type inference systems: Application to strictness analysis. In Proceedings of POPL'94, pages 202\u2013212, 1994.","DOI":"10.1145\/174675.177858"},{"key":"33_CR5","doi-asserted-by":"crossref","unstructured":"Chris Hankin and Daniel Le M\u00e9tayer. A Type-based framework for Program Analysis. In Proceedings of SAS'94, LNCS 864, pages 380\u2013394, 1994.","DOI":"10.1007\/3-540-58485-4_53"},{"key":"33_CR6","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Strictness analysis in logical form. In Proceedings of FPCA'91, LNCS 523, pages 352\u2013366, 1991.","DOI":"10.1007\/3540543961_17"},{"key":"33_CR7","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Disjunctive strictness analysis. In Proceedings of LICS'92, pages 174\u2013185, 1992.","DOI":"10.1109\/LICS.1992.185531"},{"key":"33_CR8","doi-asserted-by":"crossref","unstructured":"Tsung-Min Kuo and Prateek Mishra. Strictness analysis: A new perspective based on type inference. In Proceedings of FPCA'89, pages 260\u2013272. ACM Press, 1989.","DOI":"10.1145\/99370.99390"},{"key":"33_CR9","doi-asserted-by":"crossref","unstructured":"Alan Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proceedings of the 4th International Symposium on Programming, LNCS 83, pages 269\u2013281, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"33_CR10","volume-title":"PhD thesis","author":"A. Mycroft","year":"1981","unstructured":"Alan Mycroft. Abstract Interpretation and Optimising Transformation for Applicative programs. PhD thesis, University of Edinburgh, Scotland, 1981."},{"key":"33_CR11","doi-asserted-by":"crossref","unstructured":"David Sands. Complexity analysis for a lazy higher-order language. In Proceedings of ESOP'90, LNCS 432, pages 361\u2013376, 1990.","DOI":"10.1007\/3-540-52592-0_74"},{"key":"33_CR12","doi-asserted-by":"crossref","unstructured":"Kirsten Lackner Solberg, Hanne Riis Nielson, and Flemming Nielson. Strictness and totality analysis. In Proceedings of SAS'94, LNCS 864, pages 408\u2013422, 1994.","DOI":"10.1007\/3-540-58485-4_55"},{"key":"33_CR13","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceedings of FPCA'85, LNCS 201, pages 1\u201316, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"key":"33_CR14","doi-asserted-by":"crossref","unstructured":"Phil Wadler and John Hughes. Projections for strictness analysis. In Proceedings of FPCA'87, LNCS 27, 1987.","DOI":"10.1007\/3-540-18317-5_21"},{"key":"33_CR15","doi-asserted-by":"crossref","unstructured":"David A. Wright. A new technique for strictness analysis. In Proceedings TAPSOFT'91, LNCS 494, pages 260\u2013272. Springer Verlag, 1991.","DOI":"10.1007\/3540539816_70"},{"key":"33_CR16","unstructured":"David A. Wright. Reduction Types and Intensionality in the Lambda-Calculus. PhD thesis, University of Tasmania, 1992."}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '95: Theory and Practice of Software Development"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-59293-8_216.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:26:37Z","timestamp":1605648397000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-59293-8_216"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540592938","9783540492337"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-59293-8_216","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}