{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,8]],"date-time":"2025-07-08T14:06:54Z","timestamp":1751983614239},"reference-count":66,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,12,1]],"date-time":"1989-12-01T00:00:00Z","timestamp":628473600000},"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":8629,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1989,12]]},"DOI":"10.1016\/0304-3975(89)90091-1","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"117-242","source":"Crossref","is-referenced-by-count":59,"title":["Two-level semantics and abstract interpretation"],"prefix":"10.1016","volume":"69","author":[{"given":"Flemming","family":"Nielson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(89)90091-1_BIB1","series-title":"Abstract Interpretation of Declarative Languages","year":"1987"},{"key":"10.1016\/0304-3975(89)90091-1_BIB2","author":"Abramsky","year":"1985","journal-title":"Strictness analysis based on logical relations"},{"key":"10.1016\/0304-3975(89)90091-1_BIB3","series-title":"Compilers: Principles, Techniques, and Tools","author":"Aho","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB4","series-title":"Arrows, Structures and Functors: The Categorical Imperative","author":"Arbib","year":"1975"},{"key":"10.1016\/0304-3975(89)90091-1_BIB5","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","article-title":"Can programming be liberated from the Von Neumann style","volume":"21","author":"Backus","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(89)90091-1_BIB6","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\/0304-3975(89)90091-1_BIB7","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. Programm."},{"key":"10.1016\/0304-3975(89)90091-1_BIB8","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1145\/6041.6042","article-title":"On understanding types, data abstraction, and polymorphism","volume":"17","author":"Cardelli","year":"1985","journal-title":"ACM Comput. Surv."},{"key":"10.1016\/0304-3975(89)90091-1_BIB9","series-title":"Formal Description of Programming Concepts II","first-page":"73","article-title":"Control flow treatment in a simple semantics-directed compiler generator","author":"Christiansen","year":"1982"},{"key":"10.1016\/0304-3975(89)90091-1_BIB10","first-page":"238","article-title":"Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints","author":"Cousot","year":"1977","journal-title":"Proc. 4th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB11","first-page":"269","article-title":"Systematic design of program analysis frameworks","author":"Cousot","year":"1979","journal-title":"Proc. 6th ACM Symp. of Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB12","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB13","series-title":"Proc. ICALP '87","first-page":"21","article-title":"Inverse image analysis","volume":"267","author":"Dybjer","year":"1987"},{"key":"10.1016\/0304-3975(89)90091-1_BIB14","series-title":"The Denotational Description of Programming Languages: An Introduction","author":"Gordon","year":"1979"},{"key":"10.1016\/0304-3975(89)90091-1_BIB15","first-page":"107","article-title":"A collecting interpretation of expressions (without powerdomains)","author":"Hudak","year":"1988","journal-title":"Proc. 15th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB16","series-title":"Program Flow Analysis: Theory and Applications","first-page":"380","article-title":"Complexity of flow analysis, inductive assertion synthesis and a language due to Dijkstra","author":"Jones","year":"1981"},{"key":"10.1016\/0304-3975(89)90091-1_BIB17","first-page":"296","article-title":"Dataflow of applicative programs using minimal function graphs","author":"Jones","year":"1986","journal-title":"Proc. 13th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB18","series-title":"Semantics Directed Compiler Generation","first-page":"70","article-title":"Compiler generation from denotational semantics","volume":"94","author":"Jones","year":"1980"},{"key":"10.1016\/0304-3975(89)90091-1_BIB19","first-page":"284","article-title":"A realistic compiler generator based on high-level semantics: another progress report","author":"Lee","year":"1987","journal-title":"Proc. 14th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB20","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01752392","article-title":"Algebraic specification of data types: a synthetic approach","volume":"14","author":"Lehmann","year":"1981","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0304-3975(89)90091-1_BIB21","series-title":"Categories for the Working Mathematician","author":"Maclane","year":"1971"},{"key":"10.1016\/0304-3975(89)90091-1_BIB22","series-title":"A Theory of Programming Language Semantics","author":"Milne","year":"1976"},{"key":"10.1016\/0304-3975(89)90091-1_BIB23","series-title":"Formal Description of Programming Concepts II","first-page":"63","article-title":"Abstract semantic algebras","author":"Mosses","year":"1982"},{"key":"10.1016\/0304-3975(89)90091-1_BIB24","series-title":"Ph.D. Thesis","article-title":"Abstract interpretation and optimising transformations for applicative programs","author":"Mycroft","year":"1981"},{"key":"10.1016\/0304-3975(89)90091-1_BIB25","series-title":"Programs as Data Objects","first-page":"156","article-title":"A relational framework for abstract interpretation","volume":"217","author":"Mycroft","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB26","series-title":"Proc. ICALP '83","first-page":"536","article-title":"Strong abstract interpretation using power domains","volume":"154","author":"Mycroft","year":"1983"},{"key":"10.1016\/0304-3975(89)90091-1_BIB27","series-title":"Abstract Interpretation of Declarative Languages","first-page":"199","article-title":"A study on abstract interpretation and \u201cValidating microcode algebraically\u201d","author":"Mycroft","year":"1987"},{"key":"10.1016\/0304-3975(89)90091-1_BIB28","series-title":"Ph.D. Thesis CST-31-84","article-title":"Abstract interpretation using domain theory","author":"Nielson","year":"1984"},{"key":"10.1016\/0304-3975(89)90091-1_BIB29","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1145\/3916.3917","article-title":"Program transformations in a denotational setting","volume":"7","author":"Nielson","year":"1985","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(89)90091-1_BIB30","first-page":"211","article-title":"Tensor products generalize the relational data flow analysis method","author":"Nielson","year":"1985","journal-title":"Proc. 4th Hungarian Computer Science Conf."},{"key":"10.1016\/0304-3975(89)90091-1_BIB31","series-title":"Proc. STACS 1986","first-page":"1","article-title":"Abstract interpretation of denotational definitions","volume":"210","author":"Nielson","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB32","series-title":"Programs as Data Objects","first-page":"192","article-title":"Code generation from two-level denotational meta-languages","volume":"217","author":"Nielson","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB33","series-title":"Programs as Data Objects","first-page":"172","article-title":"Expected forms of data flow analysis","volume":"217","author":"Nielson","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB34","series-title":"Proc. ESOP 1986","first-page":"30","article-title":"Correctness of code generation from a two-level meta-language (Extended abstract)","volume":"213","author":"Nielson","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB35","series-title":"Proc. ESOP 1986","first-page":"133","article-title":"Pragmatic aspects of two-level denotational meta-languages","volume":"213","author":"Nielson","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB36_1","first-page":"31","article-title":"A bibliography on abstract interpretation","volume":"21","author":"Nielson","year":"1986","journal-title":"ACM SIGPLAN Notices"},{"key":"10.1016\/0304-3975(89)90091-1_BIB36_2","first-page":"45","article-title":"A bibliography on abstract interpretation","volume":"28","author":"Nielson","year":"1986","journal-title":"Bull. EATCS"},{"key":"10.1016\/0304-3975(89)90091-1_BIB37","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/319838.319867","article-title":"Semantics directed compiling for functional languages","author":"Nielson","year":"1986","journal-title":"Proc. 1986 ACM Conf. on LISP and Functional Programming"},{"key":"10.1016\/0304-3975(89)90091-1_BIB38_1","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(88)90041-7","article-title":"Strictness analysis and denotational abstract interpretation","volume":"76","author":"Nielson","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0304-3975(89)90091-1_BIB38_2","first-page":"120","article-title":"Strictness analysis and denotational abstract interpretation","author":"Nielson","year":"1987","journal-title":"Proc. 14th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB39","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0304-3975(86)90006-X","article-title":"Two-level semantics and code generation","volume":"56","author":"Nielson","year":"1988","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(89)90091-1_BIB40","series-title":"Abstract Interpretation of Declarative Languages","first-page":"219","article-title":"Towards a denotational theory of abstract interpretation","author":"Nielson","year":"1987"},{"key":"10.1016\/0304-3975(89)90091-1_BIB41","series-title":"Proc. ESOP 1988","first-page":"328","article-title":"2-Level \u03bb-lifting","volume":"300","author":"Nielson","year":"1988"},{"key":"10.1016\/0304-3975(89)90091-1_BIB42","series-title":"Report IR 87-02","article-title":"The core of the PSI-system","author":"Nielson","year":"1987"},{"key":"10.1016\/0304-3975(89)90091-1_BIB43_1","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0167-6423(88)90025-1","article-title":"Automatic binding time analysis for a typed \u03bb-calculus","volume":"10","author":"Nielson","year":"1988","journal-title":"Sci. Comput. Programm."},{"key":"10.1016\/0304-3975(89)90091-1_BIB43_2","first-page":"98","article-title":"Automatic binding time analysis for a typed \u03bb-calculus","author":"Nielson","year":"1988","journal-title":"Proc. 15th ACM Symp. on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(89)90091-1_BIB44","series-title":"Methods and Tools for Compiler Construction","first-page":"219","article-title":"Compiler generation from denotational semantics","author":"Paulson","year":"1984"},{"key":"10.1016\/0304-3975(89)90091-1_BIB45","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\/0304-3975(89)90091-1_BIB46","article-title":"The category of complete partial orders: a tool for making meanings","author":"Plotkin","year":"1978","journal-title":"Summerschool on Foundations of Artificial Intelligence and Computer Science"},{"key":"10.1016\/0304-3975(89)90091-1_BIB47","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\/0304-3975(89)90091-1_BIB48","series-title":"Category Theory and Computer Programming","volume":"240","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB49","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1145\/800230.806998","article-title":"Denotational semantics as a specification of code generators","author":"Raskovsky","year":"1982","journal-title":"Proc. SIGPLAN 1982 Symp. on Compiler Construction"},{"key":"10.1016\/0304-3975(89)90091-1_BIB50","series-title":"Proc. ICALP '74","first-page":"141","article-title":"On the relation between direct and continuation semantics","volume":"14","author":"Reynolds","year":"1974"},{"key":"10.1016\/0304-3975(89)90091-1_BIB51","series-title":"Proc. IFIP 1983","first-page":"513","article-title":"Types, abstraction, and parametric polymorphism","author":"Reynolds","year":"1983"},{"key":"10.1016\/0304-3975(89)90091-1_BIB52","series-title":"Denotational Semantics: A Methodology for Language Development","author":"Schnidt","year":"1986"},{"key":"10.1016\/0304-3975(89)90091-1_BIB53","doi-asserted-by":"crossref","first-page":"522","DOI":"10.1137\/0205037","article-title":"Data types as lattices","volume":"5","author":"Scott","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90091-1_BIB54","series-title":"Report PRG-19","article-title":"Lectures on a mathematical theory of computation","author":"Scott","year":"1980"},{"key":"10.1016\/0304-3975(89)90091-1_BIB55","series-title":"Proc. ICALP '82","first-page":"577","article-title":"Domains for denotational semantics","volume":"140","author":"Scott","year":"1982"},{"key":"10.1016\/0304-3975(89)90091-1_BIB56","doi-asserted-by":"crossref","first-page":"554","DOI":"10.1145\/69575.357227","article-title":"Control flow aspects of semantics directed compiling","volume":"5","author":"Sethi","year":"1983","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(89)90091-1_BIB57","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/0022-0000(78)90048-X","article-title":"Powerdomains","volume":"16","author":"Smyth","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(89)90091-1_BIB58","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1137\/0211062","article-title":"The category-theoretic solution of recursive domain equations","volume":"11","author":"Smyth","year":"1982","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(89)90091-1_BIB59","series-title":"Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(89)90091-1_BIB60","series-title":"Formal Language Description Languages for Computer Programming","article-title":"Towards a formal semantics","author":"Strachey","year":"1966"},{"key":"10.1016\/0304-3975(89)90091-1_BIB61","series-title":"Principles of Programming Languages","author":"Tennent","year":"1981"},{"key":"10.1016\/0304-3975(89)90091-1_BIB62","doi-asserted-by":"crossref","first-page":"496","DOI":"10.1145\/357172.357179","article-title":"Deriving target code as a representation of continuation semantics","volume":"4","author":"Wand","year":"1982","journal-title":"ACM TOPLAS"},{"key":"10.1016\/0304-3975(89)90091-1_BIB63","series-title":"Program Flow Analysis: Theory and Applications","first-page":"132","article-title":"Global flow analysis and optimization in the MUG2 compiler generating system","author":"Wilhelm","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900911?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397589900911?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T03:56:47Z","timestamp":1555127807000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397589900911"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":66,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["0304397589900911"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(89)90091-1","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}