{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,21]],"date-time":"2025-06-21T06:42:26Z","timestamp":1750488146859},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1998,5,1]],"date-time":"1998-05-01T00:00:00Z","timestamp":893980800000},"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":5556,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Science of Computer Programming"],"published-print":{"date-parts":[[1998,5]]},"DOI":"10.1016\/s0167-6423(96)00043-3","type":"journal-article","created":{"date-parts":[[2002,10,31]],"date-time":"2002-10-31T21:12:04Z","timestamp":1036098724000},"page":"113-145","source":"Crossref","is-referenced-by-count":4,"title":["Strictness and totality analysis"],"prefix":"10.1016","volume":"31","author":[{"given":"Kirsten Lackner Solberg","family":"Gasser","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]},{"given":"Flemming","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0167-6423(96)00043-3_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","article-title":"Abstract interpretation, logical relations and Kan extensions","volume":"1","author":"Abramsky","year":"1990","journal-title":"J. Logic Comput."},{"key":"10.1016\/S0167-6423(96)00043-3_BIB2_1","article-title":"Strictness analysis of functional programs","author":"Benton","year":"1993"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB2_2","author":"Benton","year":"1993"},{"issue":"3","key":"10.1016\/S0167-6423(96)00043-3_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":"Science of Computer Programming"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB4","series-title":"Proc. 1994 Internat. Conf. on Computer Languages, ICCL'94","first-page":"95","article-title":"Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and per analysis of functional languages)","author":"Cousot","year":"1994"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB5","series-title":"Proc. Symposium on Logic in Computer Science","article-title":"Proof of translation in natural semantics","author":"Despeyroux","year":"1986"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB6","series-title":"Proc. FPCA'91","first-page":"352","article-title":"Strictness analysis in logical form","volume":"vol. 523","author":"Jensen","year":"1991"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB7","article-title":"Abstract interpretation in logical form","author":"Jensen","year":"1992"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB8","series-title":"Proc. LICS'92","first-page":"174","article-title":"Disjunctive strictness analysis","author":"Jensen","year":"1992"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB9","series-title":"Proc. FPCA'89","first-page":"260","article-title":"Strictness analysis: A new perspective based on type inference","author":"Kuo","year":"1989"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB10","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\/S0167-6423(96)00043-3_BIB11","series-title":"Proc. 4th Internat. Symp. on Programming","first-page":"269","article-title":"The theory and practice of transforming call-by-need into call-by-value","volume":"vol. 83","author":"Mycroft","year":"1980"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB12","article-title":"Abstract interpretation and optimising transformation for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB13","series-title":"Proc. ICALP'83","article-title":"Strong abstract interpretation using power domain (extended abstract),","volume":"vol. 154","author":"Mycroft","year":"1983"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB14","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v24i492.7020","article-title":"Termination analysis based on operational semantics","author":"Nielson","year":"1995"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB15","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\/S0167-6423(96)00043-3_BIB16","article-title":"A structural approach to operational semantics","author":"Plotkin","year":"1981"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB17","series-title":"Technical Report DAIMI PB-498","article-title":"Annotated type systems for program analysis","author":"Solberg","year":"1995"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB18","series-title":"Proc. TAPSOFT'95","first-page":"501","article-title":"Strictness and totality analysis with conjunction","volume":"vol. 915","author":"Solberg","year":"1995"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB19","series-title":"Proc. FPCA'85","first-page":"1","article-title":"Miranda: A non-strict functional language with polymorphic types","volume":"vol. 201","author":"Turner","year":"1985"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB20","series-title":"Abstract Interpretation of Declarative Languages","first-page":"266","article-title":"Strictness analysis on non-flat domains (by abstract interpretation over finite domains","author":"Wadler","year":"1987"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB21","series-title":"Proc. FPCA'87","article-title":"Projections for strictness analysis","volume":"vol. 27","author":"Wadler","year":"1987"},{"key":"10.1016\/S0167-6423(96)00043-3_BIB22","series-title":"Proc. TAPSOFT'91","first-page":"260","article-title":"A new technique for strictness analysis","volume":"vol. 494","author":"Wright","year":"1991"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000433?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0167642396000433?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,29]],"date-time":"2019-04-29T13:21:14Z","timestamp":1556544074000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0167642396000433"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,5]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1998,5]]}},"alternative-id":["S0167642396000433"],"URL":"https:\/\/doi.org\/10.1016\/s0167-6423(96)00043-3","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1998,5]]}}}