{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:53:58Z","timestamp":1776891238744,"version":"3.51.2"},"reference-count":11,"publisher":"Centre pour la Communication Scientifique Directe (CCSD)","issue":"1","license":[{"start":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T00:00:00Z","timestamp":1226016000000},"content-version":"unspecified","delay-in-days":5059,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Funct. Prog."],"published-print":{"date-parts":[[1995,1]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>We re-express Hudak and Young's higher-order strictness analysis for the untyped \u03bb-calculus in a conceptually simpler and more semantically-based manner. We show our analysis to be a sound abstraction of Hudak and Young's which is also complete in a sense we make precise.<\/jats:p>","DOI":"10.1017\/s0956796800001222","type":"journal-article","created":{"date-parts":[[2008,11,7]],"date-time":"2008-11-07T11:12:13Z","timestamp":1226056333000},"page":"37-49","source":"Crossref","is-referenced-by-count":2,"title":["Untyped strictness analysis"],"prefix":"10.46298","volume":"5","author":[{"given":"Christine","family":"Ernoult","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alan","family":"Mycroft","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"25203","published-online":{"date-parts":[[2008,11,7]]},"reference":[{"key":"S0956796800001222_ref001","volume-title":"Proc. Programs as Data Objects Workshop","author":"Burn","year":"1985"},{"key":"S0956796800001222_ref006","doi-asserted-by":"crossref","unstructured":"MacQueen D. , Plotkin G. D. and Sethi R. (1984) An ideal model for recursive polymorphic types. Proc. 11th ACM Symp. on Principles of Programming Languages.","DOI":"10.1145\/800017.800528"},{"key":"S0956796800001222_ref008","unstructured":"Mycroft A. (1981) Abstract interpretation and optimising transformations of applicative programs. PhD thesis, Edinburgh University. (Available as computer science report CST-15-81.)"},{"key":"S0956796800001222_ref010","doi-asserted-by":"crossref","unstructured":"Mycroft A. (1993) Completeness and predicate-based abstract interpretation. Proc. ACM Conf. on Partial Evaluation and Program Manipulation.","DOI":"10.1145\/154630.154648"},{"key":"S0956796800001222_ref002","doi-asserted-by":"crossref","unstructured":"Ernoult C. and Mycroft A. (1991) Uniform ideals and strictness analysis. Proc. 18th ICALP, Springer-Verlag Lecture Notes in Computer Science 510.","DOI":"10.1007\/3-540-54233-7_124"},{"key":"S0956796800001222_ref004","volume-title":"Programs as Data Objects: Proc. of a Workshop","author":"Jones","year":"1985"},{"key":"S0956796800001222_ref007","doi-asserted-by":"crossref","unstructured":"Milner R. (1978) A theory of type polymorphism in programming. JCSS.","DOI":"10.1016\/0022-0000(78)90014-4"},{"key":"S0956796800001222_ref009","volume-title":"Proc. Programs as Data Objects Workshop","author":"Mycroft","year":"1985"},{"key":"S0956796800001222_ref011","unstructured":"Young J. (1989) The theory and the practice semantic program analysis for higher-order functional programming languages. PhD thesis, Department of Computer Science, Yale University. (Available as research report YALEDU\/DCS\/RR-669.)"},{"key":"S0956796800001222_ref003","doi-asserted-by":"crossref","unstructured":"Hudak P. and Young J. (1986) Higher order strictness analysis in untyped lambda calculus. Proc. 13th ACM Symp. on Principles of Programming Languages.","DOI":"10.1145\/512644.512653"},{"key":"S0956796800001222_ref005","doi-asserted-by":"crossref","unstructured":"Kuo T.-M. and Mishra P. (1989) Strictness analysis: a new perspective based on type inference. Proc. Functional Programming and Computer Architecture Conference (ACM-IFIP).","DOI":"10.1145\/99370.99390"}],"container-title":["Journal of Functional Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0956796800001222","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:18:06Z","timestamp":1776889086000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0956796800001222\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,1]]},"references-count":11,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1995,1]]}},"alternative-id":["S0956796800001222"],"URL":"https:\/\/doi.org\/10.1017\/s0956796800001222","relation":{},"ISSN":["0956-7968","1469-7653"],"issn-type":[{"value":"0956-7968","type":"print"},{"value":"1469-7653","type":"electronic"}],"subject":[],"published":{"date-parts":[[1995,1]]}}}