{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T00:47:51Z","timestamp":1775868471579,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540164463","type":"print"},{"value":"9783540397861","type":"electronic"}],"license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1986]]},"DOI":"10.1007\/3-540-16446-4_1","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T13:42:32Z","timestamp":1330177352000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":20,"title":["Strictness analysis and polymorphic invariance"],"prefix":"10.1007","author":[{"given":"Samson","family":"Abramsky","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,5,29]]},"reference":[{"key":"1_CR1","volume-title":"The Lambda Calculus: Syntax and Semantics","author":"H. Barendregt","year":"1984","unstructured":"Barendregt, H. The Lambda Calculus: Syntax and Semantics 2nd. ed., North Holland, Amsterdam, 1984.","edition":"2nd. ed."},{"key":"1_CR2","unstructured":"Burn, G. Hankin, C. and Abramsky, S. \"Strictness Analysis For Higher Order Functions\", to appear in Science Of Computer Programming, also Imperial College Department Of Computing Research Report DOC 85\/6, 1985."},{"key":"1_CR3","unstructured":"Clack, C. and Peyton Jones, S. \"Generating Parallelism from Strictness Analysis\", to appear in Proc. IFIP International Conference On Functional Languages and Computer Architectures, Springer LNCS, 1985."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Damas, L. and Milner, R. \"Principal Type Schemes for Functional Programs\", in Proc. 9th ACM Symposium On Principles Of Programming Languages, 1982.","DOI":"10.1145\/582153.582176"},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0304-3975(80)90015-8","volume":"11","author":"M. C. B. B. Hennessy","year":"1980","unstructured":"Hennessy, M. C. B. and Ashcroft, E. A. \"A Mathematical Semantics For A Nondeterministic Typed \u03bb-Calculus\", Theoretical Computer Science 11 (1980) pp. 227\u2013245, 1980.","journal-title":"Theoretical Computer Science"},{"key":"1_CR6","doi-asserted-by":"crossref","first-page":"157","DOI":"10.1145\/365230.365257","volume":"9","author":"P. J. Landin","year":"1966","unstructured":"Landin, P.J. \"The Next 700 Programming Languages\", in Communications of the ACM, 9, pp. 157\u2013166, 1966.","journal-title":"Communications of the ACM"},{"key":"1_CR7","unstructured":"Martin-L\u00f6f, P. Intuitionistic Type Theory, Bibliopolis, Naples, 1984."},{"issue":"3","key":"1_CR8","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 Systems Sciences, 17,3 pp. 348\u2013375, 1978.","journal-title":"Journal Of Computer And Systems Sciences"},{"key":"1_CR9","unstructured":"Mycroft, A. Abstract Interpretation And Optimising Transformations For Applicative Programs, Ph.D. Thesis, Edinburgh University, 1981."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"5","author":"G. Plotkin","year":"1977","unstructured":"Plotkin, G. \"LCF Considered As A Programming Language\", Theoretical Computer Science 5, pp. 223\u2013255, 1977.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"1_CR11","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-Oriented logic based on the resolution principle\", Journal of the ACM 12,1 pp. 23\u201341, 1965.","journal-title":"Journal of the ACM"},{"key":"1_CR12","volume-title":"Denotational Semantics: The Scott-Strachey Approach To Programming Language Theory","author":"J. Stoy","year":"1977","unstructured":"Stoy, J. Denotational Semantics: The Scott-Strachey Approach To Programming Language Theory, MIT Press, Cambridge Mass. 1977."}],"container-title":["Lecture Notes in Computer Science","Programs as Data Objects"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-16446-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T18:16:17Z","timestamp":1578507377000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-16446-4_1"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1986]]},"ISBN":["9783540164463","9783540397861"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/3-540-16446-4_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986]]},"assertion":[{"value":"29 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}