{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:07:56Z","timestamp":1751983676459},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540584858"},{"type":"electronic","value":"9783540490050"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1994]]},"DOI":"10.1007\/3-540-58485-4_53","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:28:25Z","timestamp":1330255705000},"page":"380-394","source":"Crossref","is-referenced-by-count":8,"title":["A type-based framework for program analysis"],"prefix":"10.1007","author":[{"given":"Chris","family":"Hankin","sequence":"first","affiliation":[]},{"given":"Daniel","family":"M\u00e9tayer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,8]]},"reference":[{"issue":"1","key":"24_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/0304-3975(92)90297-S","volume":"102","author":"S. Bakel van","year":"1992","unstructured":"S. van Bakel, Complete restrictions of the intersection type discipline, Theoretical Computer Science, 102(1):135\u2013163, 1992.","journal-title":"Theoretical Computer Science"},{"key":"24_CR2","unstructured":"P. N. Benton, Strictness logic and polymorphic invariance, in Proceedings of the 2nd Int. Symposium on Logical Foundations of Computer Science, LNCS 620, Springer Verlag, 1992."},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"P. N. Benton, Strictness Properties of Lazy Algebraic Datatypes, in Proceedings WSA'93, LNCS 724, Springer Verlag, 1993.","DOI":"10.1007\/3-540-57264-3_42"},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"G. L. Burn, A Logical Framework for Program Analysis, in Proceedings of the 1992 Glasgow Functional Programming Workshop, Springer Verlag Workshops in Computer Science, 1992.","DOI":"10.1007\/978-1-4471-3215-8_3"},{"key":"24_CR5","doi-asserted-by":"crossref","unstructured":"C. L. Hankin and D. Le M\u00e9tayer, Deriving algorithms from type inference systems: Application to strictness analysis, in Proceedings of POPL'94, ACM Press, 1994.","DOI":"10.1145\/174675.177858"},{"key":"24_CR6","doi-asserted-by":"crossref","unstructured":"C. L. Hankin and D. Le M\u00e9tayer, Lazy type inference for the strictness analysis of lists, in Proceedings of ESOP'94, LNCS 788, Springer Verlag, 1994.","DOI":"10.1007\/3-540-57880-3_17"},{"key":"24_CR7","unstructured":"J. J. Hannan, Investigating a proof-theoretic meta-language, PhD thesis, University of Pennsylvania, DIKU Technical Report Nr 91\/1, 1991."},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"J. Hannan and D. Miller, From Operational Semantics to Abstract Machines, Mathematical Structures in Computer Science, 2(4), 1992.","DOI":"10.1017\/S0960129500001559"},{"key":"24_CR9","unstructured":"L. S. Hunt, Abstract Interpretation of Functional Languages: From Theory to Practice, PhD thesis, Imperial College, 1991."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"L. S. Hunt and C. L. Hankin, Fixed Points and Frontiers: A New Perspective, Journal of Functional Programming, 1(1), 1991.","DOI":"10.1017\/S0956796800000071"},{"key":"24_CR11","doi-asserted-by":"crossref","unstructured":"L. S. Hunt and D. Sands, Binding Time Analysis: A new PERspective, in Proceedings of the ACM Symposium on Partial Evaluation and Semantics-based Program Manipulation, 1991.","DOI":"10.1145\/115865.115881"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"T. P. Jensen, Strictness Analysis in Logical Form, in J. Hughes (ed), Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, LNCS 523, Springer Verlag, 1991.","DOI":"10.1007\/3540543961_17"},{"key":"24_CR13","unstructured":"T. P. Jensen, Abstract Interpretation in Logical Form, PhD thesis, University of London, 1992. Also available as DIKU Technical Report 93\/11."},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"T.-M. Kuo and P. Mishra, Strictness analysis: a new perspective based on type inference, in Proceedings of the 4th ACM Conference on Functional Programming Languages and Computer Architecture, ACM Press, 1989.","DOI":"10.1145\/99370.99390"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"A. Leung and P. Mishra, Reasoning about simple and exhaustive demand in higher-order lazy languages, in Proceedings of the 5th ACM Conference on Functional Programming Languages and Computer Architecture, LNCS 523, Springer Verlag, 1991.","DOI":"10.1007\/3540543961_16"},{"key":"24_CR16","unstructured":"P. Wadler, Strictness Analysis on Non-flat Domains, in S. Abramsky and C. L. Hankin (eds), Abstract Interpretation of Declarative Languages, Ellis Horwood, 1987."}],"container-title":["Lecture Notes in Computer Science","Static Analysis"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58485-4_53.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:22:24Z","timestamp":1605630144000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58485-4_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994]]},"ISBN":["9783540584858","9783540490050"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-58485-4_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1994]]}}}