{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:23:06Z","timestamp":1725664986660},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540626886"},{"type":"electronic","value":"9783540684381"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-62688-3_33","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T22:49:25Z","timestamp":1330296565000},"page":"129-146","source":"Crossref","is-referenced-by-count":2,"title":["An inference algorithm for strictness"],"prefix":"10.1007","author":[{"given":"Ferruccio","family":"Damiani","sequence":"first","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,3]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H. P. Barendregt","year":"1983","unstructured":"H. P. Barendregt, M. Coppo, and M. Dezani-Ciancaglini. A filter lambda model and the completeness of type assignment. Journal of Symbolic Logic, 48:931\u2013940, 1983.","journal-title":"Journal of Symbolic Logic"},{"key":"9_CR2","unstructured":"P. N. Benton. Strictness Analysis of Lazy Functional Programs. PhD thesis, University of Cambridge, Pembroke College, 1992."},{"key":"9_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":"9_CR4","doi-asserted-by":"crossref","unstructured":"M. Coppo, F. Damiani, and P. Giannini. On Strictness and Totality. Internal report. Dipartimento di Informatica, Universit\u00e1 di Torino, 1996.","DOI":"10.1007\/BFb0014550"},{"key":"9_CR5","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"},{"issue":"4","key":"9_CR6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","volume":"21","author":"M. Coppo","year":"1980","unstructured":"M. Coppo and M. Dezani-Ciancaglini. An extension of basic functional theory for lambda-calculus. Notre Dame Journal of Formal Logic, 21(4):685\u2013693, 1980.","journal-title":"Notre Dame Journal of Formal Logic"},{"key":"9_CR7","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 strictness analysis. Theoretical Computer Science, 121:113\u2013145, 1993.","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","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":"9_CR9","doi-asserted-by":"crossref","unstructured":"M. J. C. Gordon, R. Milner, and C. P. Wadsworth. Edinburg LCF. LNCS 78. Springer, 1979.","DOI":"10.1007\/3-540-09724-4"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"C. Hankin and D. Le M\u00e9tayer. A Type-Based Framework for Program Analysis. In SAS'94, LNCS 864, pages 380\u2013394. Springer, 1994.","DOI":"10.1007\/3-540-58485-4_53"},{"key":"9_CR11","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":"9_CR12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6423(95)00012-7","volume":"25","author":"C. Hankin","year":"1995","unstructured":"C. Hankin and D. Le M\u00e9tayer. Lazy type inference and program analysis. Science of Computer Programming, 25:219\u2013249, 1995.","journal-title":"Science of Computer Programming"},{"key":"9_CR13","first-page":"29","volume":"146","author":"R. Hindley","year":"1969","unstructured":"R. Hindley. The principal types schemes for an object in combinatory logic. Transactions of American Mathematical Society, 146:29\u201360, 1969.","journal-title":"Transactions of American Mathematical Society"},{"key":"9_CR14","unstructured":"T. P. Jensen. Abstract Interpretation in Logical Form. PhD thesis, University of London, Imperial College, 1992."},{"key":"9_CR15","volume-title":"Programming Of Future Generation Computer","author":"G. Kahn","year":"1988","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":"9_CR16","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":"9_CR17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"R. Milner. A Theory of Type Polymorphism in Programming. Journal of Computer and System Science, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Science"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"J. Palsberg and P. O'Keefe. A Type System Equivalent to Flow Analysis. In POPL'95, pages 367\u2013378. ACM, 1995.","DOI":"10.1145\/199448.199533"},{"key":"9_CR19","unstructured":"A. M. Pitts. Operationally-Based Theories of Program Equivalence. Summer School on Semantics and Logics of Computation, Cambridge UK, 25\u201329 Sep 1995."},{"key":"9_CR20","volume-title":"PhD thesis","author":"K. L. Solberg","year":"1995","unstructured":"K. L. Solberg. Annotated Type Systems for Program Analysis. PhD thesis, Aarhus University, Denmark, 1995."},{"key":"9_CR21","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":"9_CR22","unstructured":"S. van Bakel. Intersection Type Disciplines in Lambda Calculus and Applicative Term Rewriting Systems. PhD thesis, Katholieke Universiteit Nijmegen, 1993."},{"key":"9_CR23","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","Typed Lambda Calculi and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-62688-3_33.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:21:06Z","timestamp":1640949666000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-62688-3_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540626886","9783540684381"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/3-540-62688-3_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}