{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:04:22Z","timestamp":1725663862621},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540539810"},{"type":"electronic","value":"9783540464990"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1991]]},"DOI":"10.1007\/3540539816_70","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T22:19:28Z","timestamp":1330208368000},"page":"235-258","source":"Crossref","is-referenced-by-count":16,"title":["A new technique for strictness analysis"],"prefix":"10.1007","author":[{"given":"David A.","family":"Wright","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,6]]},"reference":[{"unstructured":"Barendregt, H.P. The Lambda-Calculus: its Syntax and Semantics, volume 103 of Studies in Logic and the Foundations of Mathematics. North-Holland, second edition, 1984.","key":"16_CR1"},{"issue":"4","key":"16_CR2","doi-asserted-by":"crossref","first-page":"931","DOI":"10.2307\/2273659","volume":"48","author":"H.P. Barendregt","year":"1983","unstructured":"Barendregt H.P., M. Coppo and M. Dezani-Ciancaglini. A Filter Lambda-Model and the Completeness of Type Assignment. Journal of Symbolic Logic, 48(4):931\u2013940, December 1983.","journal-title":"Journal of Symbolic Logic"},{"doi-asserted-by":"crossref","unstructured":"Barendregt H.P., J.R. Kennaway, J.W. Klop and M.R. Sleep. Needed Reduction and Spine Strategies for the Lambda-Calculus. Technical report, Centre for Mathematics and Computer Science, May 1986.","key":"16_CR3","DOI":"10.1016\/0890-5401(87)90001-0"},{"doi-asserted-by":"crossref","unstructured":"Bloss, A. Update Analysis and the Efficient Implementation of Functional Aggregates. In Functional Programming and Computer Architecture, pages 26\u201338. ACM, 1989.","key":"16_CR4","DOI":"10.1145\/99370.99373"},{"unstructured":"Burn, G.L. Abstract Interpretation and the Parallel Evaluation of Functional Languages. PhD thesis, Imperial College, March 1987.","key":"16_CR5"},{"doi-asserted-by":"crossref","unstructured":"Burn, G.L. A Relationship between Abstract Interpretation and Projection Analysis. In Principles of Programming Languages, pages 151\u2013156. ACM, 1990.","key":"16_CR6","DOI":"10.1145\/96709.96724"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","volume":"7","author":"G.L. Burn","year":"1986","unstructured":"Burn G.L., C.L. 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":"16_CR8","first-page":"94","volume":"300","author":"Y-C Fuh","year":"1988","unstructured":"Fuh Y-C and P. Mishra. Type Inference with Subtypes. In European Symposium on Programming, pages 94\u2013114 Springer Verlag, LNCS 300, 1988.","journal-title":"LNCS"},{"key":"16_CR9","first-page":"167","volume":"352","author":"Y-C Fuh","year":"1989","unstructured":"Fuh Y-C and P. Mishra. Polymorphic Subtype Inference: Closing the Theory-Practice Gap. In Theory and Practice of Software Development, pages 167\u2013183. Springer Verlag, LNCS 352, 1989.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Hudak P. and R.Young. Higher-Order Strictness Analysis in Untyped Lambda-Calculus. In Principles of Programming Languages, pages 97\u2013109. ACM, 1986.","key":"16_CR10","DOI":"10.1145\/512644.512653"},{"doi-asserted-by":"crossref","unstructured":"Hughes, R.J.M. Abstract Interpretation of Polymorphic Functions. In Functional Programming, pages 31\u201340. Springer-Verlag, 1989.","key":"16_CR11","DOI":"10.1007\/978-1-4471-3166-3_3"},{"key":"16_CR12","first-page":"82","volume":"389","author":"R.J.M. Hughes","year":"1989","unstructured":"Hughes, R.J.M. Projections for Polymorphic Strictness Analysis. In Category Theory and Computer Science, pages 82\u2013100. Springer Verlag, LNCS 389, 1989.","journal-title":"LNCS"},{"key":"16_CR13","first-page":"206","volume":"431","author":"A.J. Kfoury","year":"1990","unstructured":"Kfoury A.J., J. Tiuryn and P. Urzyczyn. ML Typability is DEXPTIME-Complete. In CAAP'90, pages 206\u2013220. Springer Verlag, LNCS 431, 1990.","journal-title":"LNCS"},{"unstructured":"Klop, J.W. Combinatory Reduction Systems. PhD thesis, State University of Utrecht, 1980.","key":"16_CR14"},{"doi-asserted-by":"crossref","unstructured":"Kuo T-M and P. Mishra. Strictness Analysis: A New Perspective based on Type Inference. In Functional Programming and Computer Architecture, pages 260\u2013272. ACM, 1989.","key":"16_CR15","DOI":"10.1145\/99370.99390"},{"key":"16_CR16","first-page":"211","volume":"440","author":"H. Leiss","year":"1989","unstructured":"Leiss, H. Polymorphic Recursion and Semi-Unification In CSL'89, pages 211\u2013224. Springer Verlag, LNCS 440, 1989.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Mairson, H.G. Deciding ML Typability is Complete for Deterministic Exponential Time. In Principles of Programming Languages, pages 382\u2013401. ACM, 1990.","key":"16_CR17","DOI":"10.1145\/96709.96748"},{"key":"16_CR18","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1016\/S0747-7171(89)80013-6","volume":"7","author":"U. Martin","year":"1989","unstructured":"Martin U. and T. Nipkow. Boolean Ring Unification\u2014the story so far. Journal of Symbolic Computation, 7:275\u2013293, 1989.","journal-title":"Journal of Symbolic Computation"},{"key":"16_CR19","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1016\/0022-0000(78)90014-4","volume":"17","author":"R. Milner","year":"1978","unstructured":"Milner, R. A Theory of Type Polymorphism in Programming. Journal of Computer and System Sciences, 17:348\u2013375, 1978.","journal-title":"Journal of Computer and System Sciences"},{"doi-asserted-by":"crossref","unstructured":"Mitchell, J.C. Coercion and Type Inference (Summary). In Principles of Programming Languages, pages 175\u2013185. ACM, 1984.","key":"16_CR20","DOI":"10.1145\/800017.800529"},{"unstructured":"Peyton-Jones, S.L. The Implementation of Functional Programming Languages. Prentice-Hall, 1987.","key":"16_CR21"},{"key":"16_CR22","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1145\/321250.321253","volume":"12","author":"J.A. Robinson","year":"1965","unstructured":"Robinson, J.A. A Machine-Orientated Logic based on the Resolution Principle. Journal of the ACM, 12:23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"16_CR23","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1016\/S0747-7171(89)80012-4","volume":"7","author":"J.H. Siekmann","year":"1989","unstructured":"Siekmann, J.H. Unification Theory. Journal of Symbolic Computation, 7:207\u2013274, 1989.","journal-title":"Journal of Symbolic Computation"},{"unstructured":"Wadler, P.L. Strictness Analysis on Non-flat Domains (by Abstract Interpretation over Finite Domains). In S. Abramsky and C.L. Hankin, editors, Abstract interpretation of declarative languages. Ellis Horwood Limited, 1987.","key":"16_CR24"},{"key":"16_CR25","first-page":"385","volume":"274","author":"P.L. Wadler","year":"1987","unstructured":"Wadler P.L. and R.J.M. Hughes. Projections for Strictness Analysis. In Functional Programming Languages and Computer Architecture, pages 385\u2013407. Springer-Verlag, LNCS 274, 1987.","journal-title":"LNCS"},{"doi-asserted-by":"crossref","unstructured":"Wand M. and P. O'Keefe. On the Complexity of Type Inference with Coercion. In Functional Programming and Computer Architecture, pages 293\u2013297. ACM, 1989.","key":"16_CR26","DOI":"10.1145\/99370.99394"},{"unstructured":"Wright, D.A. Strictness Analysis Via (Type) Inference. Technical Report 89\/3, University of Tasmania, September 1989.","key":"16_CR27"},{"unstructured":"Wright, D.A. Type Inference and the Reduction Behaviour of Functional Programs. PhD thesis, University of Tasmania. (In preparation).","key":"16_CR28"}],"container-title":["Lecture Notes in Computer Science","TAPSOFT '91"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3540539816_70.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T03:33:51Z","timestamp":1640921631000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3540539816_70"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991]]},"ISBN":["9783540539810","9783540464990"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/3540539816_70","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1991]]}}}