{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:26:45Z","timestamp":1758709605026},"publisher-location":"Berlin, Heidelberg","reference-count":23,"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_55","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:40Z","timestamp":1330255720000},"page":"408-422","source":"Crossref","is-referenced-by-count":14,"title":["Strictness and totality analysis"],"prefix":"10.1007","author":[{"given":"Kirsten Lackner","family":"Solberg","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1","key":"26_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":"26_CR2","unstructured":"Nick Benton. Strictness Analysis of Functional Programs. PhD thesis, University of Cambridge, 1993. Available as Technical Report No. 309."},{"key":"26_CR3","unstructured":"Stefano Berardi. \u201cPruning\u201d simply typed \u03bb-terms. Technical report, Turin University, 1993."},{"key":"26_CR4","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":"26_CR5","doi-asserted-by":"crossref","unstructured":"Philippa Gardner. Discovering needed reductions using type theory. In Proceeding of TACS'94, 1994.","DOI":"10.1007\/3-540-57887-0_115"},{"key":"26_CR6","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":"26_CR7","first-page":"257","volume":"788","author":"C. Hankin","year":"1994","unstructured":"Chris Hankin, and Daniel Le M\u00e9tayer. Lazy type inference for the strictness analysis of lists. In Proceedings of ESOP'94, LNCS 788, pages 257\u2013271, 1994.","journal-title":"Proceedings of ESOP'94, LNCS"},{"key":"26_CR8","first-page":"352","volume":"523","author":"T. P. Jensen","year":"1991","unstructured":"Thomas P. Jensen. Strictness analysis in logical form. In Proceedings FPCA'91, LNCS 523, pages 352\u2013366, 1991.","journal-title":"Proceedings FPCA'91, LNCS"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Thomas P. Jensen. Disjunctive strictness analysis. In Proceedings LICS' 92, pages 174\u2013185, 1992.","DOI":"10.1109\/LICS.1992.185531"},{"key":"26_CR10","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":"26_CR11","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1007\/3-540-09981-6_19","volume":"83","author":"A. Mycroft","year":"1980","unstructured":"Alan Mycroft. The theory and practice of transforming call-by-need into call-by-value. In Proceeding of the 4th International Symposium on Programming, LNCS 83, pages 269\u2013281, 1980.","journal-title":"Proceeding of the 4th International Symposium on Programming, LNCS"},{"key":"26_CR12","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":"26_CR13","first-page":"536","volume":"154","author":"A. Mycroft","year":"1983","unstructured":"Alan Mycroft, and Flemming Nielson. Strong abstract interpretation using power domain (extended abstract). In Proceedings of ICALP'83, LNCS 154, pages 536\u2013547, 1983.","journal-title":"Proceedings of ICALP'83, LNCS"},{"key":"26_CR14","unstructured":"Flemming Nielson, Hanne Riis Nielson. Termination Analysis. Manuscript, Aarhus University, 1994."},{"key":"26_CR15","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/3-540-52592-0_74","volume":"432","author":"D. Sands","year":"1990","unstructured":"David Sands. Complexity Analysis for a Lazy Higher-Order Language. In Proceedings of ESOP'90, LNCS 432, pages 361\u2013376, 1990.","journal-title":"Proceedings of ESOP'90, LNCS"},{"key":"26_CR16","volume-title":"Forthcoming report","author":"K. L. Solberg","year":"1994","unstructured":"Kirsten Lackner Solberg. Strictness and totality analysis. Forthcoming report, Odense University, Denmark, 1994."},{"issue":"3","key":"26_CR17","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1017\/S0956796800000393","volume":"2","author":"J. Talpin","year":"1992","unstructured":"Jean-Pierre Talpin, and Pierre Jouvelot. Polymorphic type, region and effect inference. Journal of Functional Programming, 2(3):162\u2013173, 1992.","journal-title":"Journal of Functional Programming"},{"key":"26_CR18","doi-asserted-by":"crossref","unstructured":"Jean-Pierre Talpin and Pierre Jouvelot. The type and effect discipline. In Proceedings of LICS'92, 1992.","DOI":"10.1109\/LICS.1992.185530"},{"key":"26_CR19","doi-asserted-by":"crossref","unstructured":"Mads Tofte and Jean-Pierre Talpin. Data region inference for polymorphic functional languages. In Proceedings of POPL'94, pages 188\u2013201, 1994.","DOI":"10.1145\/174675.177855"},{"key":"26_CR20","first-page":"1","volume":"201","author":"D. A. Turner","year":"1985","unstructured":"D. A. Turner. Miranda: A non-strict functional language with polymorphic types. In Proceeding of FPCA'85, LNCS 201, pages 1\u201316, 1985.","journal-title":"Proceeding of FPCA'85, LNCS"},{"key":"26_CR21","unstructured":"Phil Wadler. Strictness analysis on non-flat domains by abstract interpretation over finite domains. In S. Abramsky and C. Hankin (eds.), editors, Abstract Interpretation of Declarative Languages, pages 266\u2013275. Ellis Horwood, 1987."},{"key":"26_CR22","doi-asserted-by":"crossref","unstructured":"Phil Wadler, John Hughes. Projections for strictness analysis. In Proceedings of FPCA'87, LNCS 274, 1987.","DOI":"10.1007\/3-540-18317-5_21"},{"key":"26_CR23","first-page":"260","volume":"494","author":"D. A. Wright","year":"1991","unstructured":"David A. Wright. A new technique for strictness analysis. In Proceedings of TAPSOFT'91, LNCS 494, pages 260\u2013272, 1991.","journal-title":"Proceedings of TAPSOFT'91, LNCS"}],"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_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T21:18:09Z","timestamp":1619558289000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}