{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:29:49Z","timestamp":1725456589316},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540633884"},{"type":"electronic","value":"9783540695301"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0014550","type":"book-chapter","created":{"date-parts":[[2005,11,23]],"date-time":"2005-11-23T09:17:33Z","timestamp":1132737453000},"page":"138-164","source":"Crossref","is-referenced-by-count":3,"title":["On strictness and totality"],"prefix":"10.1007","author":[{"given":"Mario","family":"Coppo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ferruccio","family":"Damiani","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paola","family":"Giannini","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"issue":"1","key":"6_CR1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","volume":"1","author":"S. Abramsky","year":"1990","unstructured":"S. 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":"6_CR2","unstructured":"P. N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis. University of Cambridge, Pembroke College, 1992."},{"key":"6_CR3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G. L. Burn","year":"1986","unstructured":"G. L. Burn, C. Hankin, and S. Abramsky. Strictness Analysis for Higher-Order Functions. Science of Computer Programming, 7:249\u2013278, 1986.","journal-title":"Science of Computer Programming"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"M. Coppo, F. Damiani, and P. Giannini. Refinement Types for Program Analysis. In SAS'96, LNCS 1145, pages 143\u2013158. Springer, 1996.","DOI":"10.1007\/3-540-61739-6_39"},{"key":"6_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(93)90086-9","volume":"121","author":"M. Coppo","year":"1993","unstructured":"M. Coppo and A. Ferrari. Type inference, abstract interpretation and srictness analysis. Theoretical Computer Science, 121:113\u2013145, 1993.","journal-title":"Theoretical Computer Science"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"D. Dussart and F. Henglein and C. Mossin. Polymorphic Recursion and Subtype Qualifications: Polymorphic Binding-Time Analysis in Polynomial Time. In SAS'95, LNCS 983, pages 118\u2013135. Springer, 1995.","DOI":"10.1007\/3-540-60360-3_36"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"F. Damiani and P. Giannini. An Inference Algorithm for Strictness. In TLCA'97, LNCS 1210, pages 129\u2013146. Springer, 1997.","DOI":"10.1007\/3-540-62688-3_33"},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"C. Hankin and D. Le M\u00e9tayer. Deriving algorithms for type inference systems: Applications to strictness analysis. In POPL'94, pages 202\u2013212. ACM, 1994.","DOI":"10.1145\/174675.177858"},{"key":"6_CR9","unstructured":"T. P. Jensen. Abstract Interpretation in Logical Form. PhD thesis, University of London, Imperial College, 1992."},{"key":"6_CR10","unstructured":"G. Kahn. Natural semantics. In K. Fuchi and M. Nivat, editors, Programming Of Future Generation Computer. Elsevier Sciences B.V. (North-Holland), 1988."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"T. M. Kuo and P. Mishra. Strictness analysis: a new perspective based on type inference. In Functional Programming Languages and Computer Architecture, pages 260\u2013272. ACM, 1989.","DOI":"10.1145\/99370.99390"},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"A. Mycroft. The theory and practice of transforming call-by-need into call-byvalue. In International Symposium on Programming, LNCS 83, pages 269\u2013281. Springer, 1980.","DOI":"10.1007\/3-540-09981-6_19"},{"key":"6_CR13","volume-title":"Abstract Interpretation and Optimizing Transforming for Applicative programs","author":"A. Mycroft","year":"1981","unstructured":"A. Mycroft. Abstract Interpretation and Optimizing Transforming for Applicative programs. PhD thesis, University of Edinburgh, Scotland, 1981."},{"key":"6_CR14","doi-asserted-by":"crossref","unstructured":"A. M. Pitts. Operationally-based theories of program equivalence. In A. M. Pitts and P. Dybjer, editors, Semantics and Logics of Computation, pages 241\u2013298. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511526619.007"},{"key":"6_CR15","volume-title":"Annotated Type Systems for Program Analysis","author":"K. L. Solberg","year":"1995","unstructured":"K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, 1995. Revised version."},{"key":"6_CR16","doi-asserted-by":"crossref","unstructured":"K. L. Solberg.Strictness and Totality Analysis with Conjunction. In TAPSOFT'95, LNCS 915, pages 501\u2013515. Springer, I995.","DOI":"10.1007\/3-540-59293-8_216"},{"key":"6_CR17","unstructured":"K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. Science of Computer Programming. To appear."},{"key":"6_CR18","doi-asserted-by":"crossref","unstructured":"K. L. Solberg, H. R. Nielson, and F. Nielson. Strictness and Totality Analysis. In SAS'94, LNCS 864, pages 408\u2013422. Springer, 1994.","DOI":"10.1007\/3-540-58485-4_55"},{"key":"6_CR19","unstructured":"D. A. Wright. Reduction Types and Intensionality in the Lambda-Calculus. PhD thesis, University of Tasmania, 1992."}],"container-title":["Lecture Notes in Computer Science","Theoretical Aspects of Computer Software"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0014550","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,11]],"date-time":"2020-04-11T04:48:08Z","timestamp":1586580488000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0014550"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540633884","9783540695301"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/bfb0014550","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}