{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,27]],"date-time":"2024-08-27T12:28:18Z","timestamp":1724761698978},"reference-count":14,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"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":10059,"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":[[1986]]},"DOI":"10.1016\/0167-6423(86)90010-9","type":"journal-article","created":{"date-parts":[[2003,3,25]],"date-time":"2003-03-25T16:44:35Z","timestamp":1048610675000},"page":"249-278","source":"Crossref","is-referenced-by-count":120,"special_numbering":"C","title":["Strictness analysis for higher-order functions"],"prefix":"10.1016","volume":"7","author":[{"given":"Geoffrey L.","family":"Burn","sequence":"first","affiliation":[]},{"given":"Chris","family":"Hankin","sequence":"additional","affiliation":[]},{"given":"Samson","family":"Abramsky","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6423(86)90010-9_BIB1","series-title":"Proc. Workshop on Programs as Data Objects","first-page":"1","article-title":"Strictness analysis and polymorphic invariance","volume":"217","author":"Abramsky","year":"1986"},{"key":"10.1016\/0167-6423(86)90010-9_BIB2","series-title":"Arrows, Structures and Functors: The Categorical Imperative","author":"Arbib","year":"1975"},{"key":"10.1016\/0167-6423(86)90010-9_BIB3","unstructured":"C. Clack and S.L. Peyton Jones, Generating parallelism from strictness analysis, Department of Computer Science, University College London, Internal Note 1679."},{"key":"10.1016\/0167-6423(86)90010-9_BIB4","series-title":"A Compendium of Continuous Lattices","author":"Gierz","year":"1980"},{"key":"10.1016\/0167-6423(86)90010-9_BIB5","series-title":"Proc. Mathematical Foundations in Computer Science 1979","first-page":"108","article-title":"Full abstraction for a simple parallel programming language","volume":"74","author":"Hennessy","year":"1979"},{"key":"10.1016\/0167-6423(86)90010-9_BIB6","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\/0167-6423(86)90010-9_BIB7","article-title":"Abstract interpretation and optimising transformations for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/0167-6423(86)90010-9_BIB8","series-title":"Proc. 10th International Colloquium on Automata, Languages and Programming","first-page":"536","article-title":"Strong abstract interpretation using power domains (Extended Abstract)","volume":"154","author":"Mycroft","year":"1983"},{"issue":"3","key":"10.1016\/0167-6423(86)90010-9_BIB9","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","article-title":"A powerdomain construction","volume":"5","author":"Plotkin","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(86)90010-9_BIB10","series-title":"Proc. 9th International Colloquium on Automata, Languages and Programming","first-page":"418","article-title":"A power domain for countable non-determinism (Extended Abstract)","volume":"140","author":"Plotkin","year":"1982"},{"key":"10.1016\/0167-6423(86)90010-9_BIB11","series-title":"Tech. Monograph PRG-19","article-title":"Lectures on a Mathematical Theory of Computation","author":"Scott","year":"1981"},{"key":"10.1016\/0167-6423(86)90010-9_BIB12","series-title":"Proc. 9th International Colloquim on Automata, Languages and Programming","first-page":"577","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"key":"10.1016\/0167-6423(86)90010-9_BIB13","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0167-6423(86)90010-9_BIB14","article-title":"Semantics and pragmatics of the lambda calculus","author":"Wadsworth","year":"1971"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900109?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642386900109?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,24]],"date-time":"2019-03-24T15:50:23Z","timestamp":1553442623000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642386900109"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986]]},"references-count":14,"alternative-id":["0167642386900109"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(86)90010-9","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1986]]}}}