{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:42:28Z","timestamp":1750488148985},"reference-count":25,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,2,1]],"date-time":"2002-02-01T00:00:00Z","timestamp":1012521600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4184,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,2]]},"DOI":"10.1016\/s0304-3975(00)00348-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T10:11:15Z","timestamp":1027591875000},"page":"69-112","source":"Crossref","is-referenced-by-count":11,"title":["Strictness, totality, and non-standard-type inference"],"prefix":"10.1016","volume":"272","author":[{"given":"Mario","family":"Coppo","sequence":"first","affiliation":[]},{"given":"Ferruccio","family":"Damiani","sequence":"additional","affiliation":[]},{"given":"Paola","family":"Giannini","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(00)00348-0_BIB1","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","article-title":"A filter lambda model and the completeness of type assignment","volume":"48","author":"Barendregt","year":"1983","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB2","series-title":"Strictness analysis of lazy functional programs, Ph.D. Thesis","author":"Benton","year":"1992"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher-order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB4","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1016\/0304-3975(84)90005-7","article-title":"Completeness of type assignment in continuous lambda models","volume":"29","author":"Coppo","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB5","doi-asserted-by":"crossref","unstructured":"M. Coppo, F. Damiani, P. Giannini, On strictness and totality, In TACS\u201997, Lecture Notes in Computer Science, vol. 1281, Springer, Berlin, 1997, pp. 138\u2013164.","DOI":"10.1007\/BFb0014550"},{"issue":"4","key":"10.1016\/S0304-3975(00)00348-0_BIB6","doi-asserted-by":"crossref","first-page":"685","DOI":"10.1305\/ndjfl\/1093883253","article-title":"An extension of basic functional theory for lambda-calculus","volume":"21","author":"Coppo","year":"1980","journal-title":"Notre Dame J. Formal Logic"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB7","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1002\/malq.19810270205","article-title":"Functional characters of solvable terms","volume":"27","author":"Coppo","year":"1981","journal-title":"Z. Math. Logik Grund. Math."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB8","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0304-3975(93)90086-9","article-title":"Type inference, abstract interpretation and strictness analysis","volume":"121","author":"Coppo","year":"1993","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB9","doi-asserted-by":"crossref","unstructured":"L.M.M. Damas, R. Milner, Principal type schemas for functional programs, POPL\u201982, ACM, New York, 1982, pp. 207\u2013212.","DOI":"10.1145\/582153.582176"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB10","unstructured":"F. Damiani, Non-standard type inference for functional programs, Ph.D. Thesis, Dipartimento di Informatica, Universit\u00e0 di Torino, February 1998."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB11","doi-asserted-by":"crossref","unstructured":"C. Hankin, D. Le M\u00e9tayer, Deriving algorithms for type inference systems: applications to strictness analysis, POPL\u201994, ACM, New York, 1994, pp. 202\u2013212.","DOI":"10.1145\/174675.177858"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB12","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0167-6423(95)00012-7","article-title":"Lazy type inference and program analysis","volume":"25","author":"Hankin","year":"1995","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB13","first-page":"29","article-title":"The principal type scheme for an object in combinatory logic","volume":"146","author":"Hindley","year":"1969","journal-title":"Trans. Amer. Math. Soc."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB14","series-title":"Abstract interpretation in logical form, Ph.D. Thesis","author":"Jensen","year":"1992"},{"issue":"4","key":"10.1016\/S0304-3975(00)00348-0_BIB15","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1093\/logcom\/5.4.397","article-title":"Conjunctive type systems and abstract interpretation of higher-order functional programs","volume":"5","author":"Jensen","year":"1995","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB16","unstructured":"G. Kahn, Natural semantics, in: K. Fuchi, M. Nivat (Eds.), Programming Of Future Generation Computer, Elsevier Sciences B.V., North-Holland, Amsterdam, 1988."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB17","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","article-title":"A theory of type polymorphism in programming","volume":"17","author":"Milner","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB18","doi-asserted-by":"crossref","unstructured":"A.M. Pitts, Operationally-based theories of program equivalence, in: A.M. Pitts, P. Dybjer (Eds.), Semantics and Logics of Computation, Cambridge University Press, Cambridge, 1997,, pp. 241\u2013298.","DOI":"10.1017\/CBO9780511526619.007"},{"issue":"3","key":"10.1016\/S0304-3975(00)00348-0_BIB19","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","article-title":"LCF considered as a programming language","volume":"5","author":"Plotkin","year":"1977","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB20","unstructured":"G.D. Plotkin, A structural approach to operational semantics, Tech. Report DAIMI FN-19, Aarhus University, 1981."},{"key":"10.1016\/S0304-3975(00)00348-0_BIB21","doi-asserted-by":"crossref","unstructured":"K.L. Solberg, Annotated type systems for program analysis, Ph.D. Thesis, Aarhus University, Denmark, 1995, Revised version.","DOI":"10.7146\/dpb.v24i498.7026"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB22","doi-asserted-by":"crossref","unstructured":"K.L. Solberg, Strictness and totality analysis with conjunction, TAPSOFT\u201995 Lecture Notes in Computer Science, vol. 915, Springer, Berlin, 1995, pp. 501\u2013515.","DOI":"10.1007\/3-540-59293-8_216"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB23","doi-asserted-by":"crossref","unstructured":"K.L. Solberg, H.R. Nielson, F. Nielson, Strictness and totality analysis, SAS\u201994, Lecture Notes in Computer Science, vol. 864, Springer, Berlin, 1994, pp. 408\u2013422.","DOI":"10.1007\/3-540-58485-4_55"},{"issue":"1","key":"10.1016\/S0304-3975(00)00348-0_BIB24","first-page":"112","article-title":"Strictness and totality analysis","volume":"31","author":"Solberg","year":"1998","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/S0304-3975(00)00348-0_BIB25","doi-asserted-by":"crossref","unstructured":"S. van Bakel, Intersection type disciplines in Lambda calculus and applicative term rewriting systems, Ph.D. Thesis, Katholieke Universiteit Nijmegen, 1993.","DOI":"10.1007\/BFb0037096"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003480?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397500003480?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T02:02:46Z","timestamp":1578448966000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397500003480"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,2]]},"references-count":25,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,2]]}},"alternative-id":["S0304397500003480"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(00)00348-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,2]]}}}