{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,30]],"date-time":"2022-12-30T18:53:40Z","timestamp":1672426420482},"reference-count":19,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1994,6,1]],"date-time":"1994-06-01T00:00:00Z","timestamp":770428800000},"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":6986,"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":[[1994,6]]},"DOI":"10.1016\/0167-6423(94)00009-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"327-354","source":"Crossref","is-referenced-by-count":4,"title":["The tensor product in Wadler's analysis of lists"],"prefix":"10.1016","volume":"22","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]},{"given":"Hanne Riis","family":"Nielson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-6423(94)00009-3_BIB1","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1093\/logcom\/1.1.5","article-title":"Abstract interpretation, logical relations and Kan extensions","volume":"1","author":"Abramsky","year":"1990","journal-title":"J. Logic Comput."},{"key":"10.1016\/0167-6423(94)00009-3_BIB2","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1007\/BF01182783","article-title":"The tensor product of continuous lattices","volume":"172","author":"Bandelt","year":"1980","journal-title":"Math. Z."},{"key":"10.1016\/0167-6423(94)00009-3_BIB3","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0167-6423(86)90010-9","article-title":"Strictness analysis for higher-order functions","volume":"7","author":"Burn","year":"1986","journal-title":"Sci. Comput. Programming"},{"key":"10.1016\/0167-6423(94)00009-3_BIB4","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979","journal-title":"Proceedings Conference on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(94)00009-3_BIB5","series-title":"Functional Programming, Glasgow 1989","first-page":"41","article-title":"An iterative powerdomain construction","author":"Ferguson","year":"1989"},{"key":"10.1016\/0167-6423(94)00009-3_BIB6","series-title":"Lattice Theory: First Concepts and Distributive Lattices","author":"Gr\u00e4tzer","year":"1971"},{"key":"10.1016\/0167-6423(94)00009-3_BIB7","series-title":"Proceedings Programs as Data Objects","first-page":"112","article-title":"Strictness detection in non-flat domains","volume":"217","author":"Hughes","year":"1986"},{"key":"10.1016\/0167-6423(94)00009-3_BIB8","series-title":"Partial Evaluation and Mixed Computation","first-page":"187","article-title":"Backwards analysis of functional programs","author":"Hughes","year":"1988"},{"key":"10.1016\/0167-6423(94)00009-3_BIB9","series-title":"Proceedings European Symposium on Programming","first-page":"269","article-title":"Reversing abstract interpretations","volume":"582","author":"Hughes","year":"1992"},{"key":"10.1016\/0167-6423(94)00009-3_BIB10","series-title":"Program Flow Analysis: Theory and Applications","article-title":"Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra","author":"Jones","year":"1981"},{"key":"10.1016\/0167-6423(94)00009-3_BIB11","series-title":"Categories for the Working Mathematician","author":"Mac Lane","year":"1971"},{"key":"10.1016\/0167-6423(94)00009-3_BIB12","series-title":"Ph.D. Thesis","article-title":"Abstract interpretation using domain theory","author":"Nielson","year":"1984"},{"key":"10.1016\/0167-6423(94)00009-3_BIB13","first-page":"211","article-title":"Tensor products generalize the relational data flow analysis method","author":"Nielson","year":"1985","journal-title":"Proceedings Fourth Hungarian Computer Science Conference"},{"key":"10.1016\/0167-6423(94)00009-3_BIB14","series-title":"Abstract Interpretation of Declarative Languages","first-page":"219","article-title":"Towards a denotational theory of abstract interpretation","author":"Nielson","year":"1987"},{"issue":"2","key":"10.1016\/0167-6423(94)00009-3_BIB15","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/0304-3975(89)90091-1","article-title":"Two-level semantics and abstract interpretation","volume":"69","author":"Nielson","year":"1989","journal-title":"Theoret. Comput. Sci. Fund. Stud."},{"key":"10.1016\/0167-6423(94)00009-3_BIB16","series-title":"Two-Level Functional Languages","author":"Nielson","year":"1992"},{"key":"10.1016\/0167-6423(94)00009-3_BIB17","series-title":"To H.B. Curry: Essays on Combinatorial Logic, Lambda Calculus and Formalism","article-title":"Lambda definability in the full type hierarchy","author":"Plotkin","year":"1980"},{"key":"10.1016\/0167-6423(94)00009-3_BIB18","series-title":"Abstract Interpretation of Declarative Languages","first-page":"266","article-title":"Strictness analysis on non-flat domains (by abstract interpretation over finite domains)","author":"Wadler","year":"1987"},{"key":"10.1016\/0167-6423(94)00009-3_BIB19","series-title":"Proceedings Functional Programming Languages and Computer Architecture","first-page":"385","article-title":"Projections for strictness analysis","volume":"274","author":"Wadler","year":"1987"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000093?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642394000093?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T17:55:41Z","timestamp":1555091741000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642394000093"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,6]]},"references-count":19,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1994,6]]}},"alternative-id":["0167642394000093"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(94)00009-3","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1994,6]]}}}