{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T08:18:24Z","timestamp":1672733904300},"reference-count":41,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1982,5,1]],"date-time":"1982-05-01T00:00:00Z","timestamp":389059200000},"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":11400,"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":[[1982,5]]},"DOI":"10.1016\/0167-6423(82)90015-6","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:09:22Z","timestamp":1027656562000},"page":"203-222","source":"Crossref","is-referenced-by-count":3,"title":["Circular expressions: elimination of static environments"],"prefix":"10.1016","volume":"1","author":[{"given":"Ravi","family":"Sethi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/0167-6423(82)90015-6_BIB1","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","article-title":"Initial algebra semantics and continuous algebras","volume":"24","author":"Goguen","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(82)90015-6_BIB2","first-page":"110","article-title":"Universality of data retrieval languages","author":"Aho","year":"1979","journal-title":"Proc. 6th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(82)90015-6_BIB3","article-title":"The Calculi of Lambda Conversion","volume":"6","author":"Church","year":"1941"},{"key":"10.1016\/0167-6423(82)90015-6_BIB4","first-page":"137","article-title":"Algebraic families of interpretations","author":"Courcelle","year":"1976","journal-title":"Proc. 17th Annual Symposium on Foundations of Computer Science"},{"key":"10.1016\/0167-6423(82)90015-6_BIB5","doi-asserted-by":"crossref","first-page":"758","DOI":"10.1145\/322217.322228","article-title":"Variations on the common subexpression problem","author":"Downey","year":"1980","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(82)90015-6_BIB6","series-title":"Semantics-Directed Compiler Generation","first-page":"140","article-title":"Specification of compilers as abstract data type representations","volume":"94","author":"Gaudel","year":"1980"},{"key":"10.1016\/0167-6423(82)90015-6_BIB7","series-title":"The Denotational Description of Programming Languages","author":"Gordon","year":"1979"},{"key":"10.1016\/0167-6423(82)90015-6_BIB8","first-page":"169","article-title":"An interpreter generator using tree pattern matching","author":"Hoffman","year":"1979","journal-title":"Proc. 6th Annual ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0167-6423(82)90015-6_BIB9","article-title":"Call by need computations in non-ambigous linear term rewriting systems","author":"Huet","year":"1979","journal-title":"Rapport Laboria 359"},{"issue":"3","key":"10.1016\/0167-6423(82)90015-6_BIB10","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1112\/jlms\/s2-12.3.361","article-title":"A syntactic characterization of the equality in some models for the lambda calculus","volume":"12","author":"Hyland","year":"1976","journal-title":"J. London Math. Soc. Second Series"},{"key":"10.1016\/0167-6423(82)90015-6_BIB11","series-title":"CSTR 32","article-title":"Yacc\u2014yet another compiler compiler","author":"Johnson","year":"1975"},{"key":"10.1016\/0167-6423(82)90015-6_BIB12","article-title":"Semantics-Directed Compiler Generation","volume":"94","year":"1980"},{"key":"10.1016\/0167-6423(82)90015-6_BIB13","series-title":"The C Programming Language","author":"Kernighan","year":"1978"},{"key":"10.1016\/0167-6423(82)90015-6_BIB14","series-title":"CSTR","article-title":"PIC\u2014A crude graphics language for typesetting","author":"Kernighan","year":"1980"},{"issue":"4","key":"10.1016\/0167-6423(82)90015-6_BIB15","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/6.4.308","article-title":"The mechanical evaluation of expressions","volume":"6","author":"Landin","year":"1964","journal-title":"Comput. J."},{"issue":"2, 3","key":"10.1016\/0167-6423(82)90015-6_BIB16_1","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1145\/363744.363749","article-title":"A correspondence between Algol 60 and Church's lambda-notation","volume":"8","author":"Landin","year":"1965","journal-title":"Comm. ACM"},{"issue":"2, 3","key":"10.1016\/0167-6423(82)90015-6_BIB16_2","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1145\/363791.363804","article-title":"A correspondence between Algol 60 and Church's lambda-notation","volume":"8","author":"Landin","year":"1965","journal-title":"Comm. ACM"},{"key":"10.1016\/0167-6423(82)90015-6_BIB17_1","series-title":"CSTR","article-title":"Lex\u2014a lexical analyzer generator","author":"Lesk","year":"1975"},{"key":"10.1016\/0167-6423(82)90015-6_BIB17_2","volume":"2","author":"Lesk","year":"1979"},{"issue":"1","key":"10.1016\/0167-6423(82)90015-6_BIB18","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb\u03b2\u03ba-calculus and an application of labelled \u03bb-calculus","volume":"2","author":"Levy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0167-6423(82)90015-6_BIB19","series-title":"Information Processing 1962","first-page":"21","article-title":"Towards a mathematical science of computation","author":"McCarthy","year":"1963"},{"key":"10.1016\/0167-6423(82)90015-6_BIB20","volume":"2 Vols.","author":"Milne","year":"1976"},{"key":"10.1016\/0167-6423(82)90015-6_BIB21","series-title":"DAIMI MD-30","article-title":"SIS\u2014semantics implementation system: Reference manual and user guide","author":"Mosses","year":"1979"},{"key":"10.1016\/0167-6423(82)90015-6_BIB22","series-title":"DAIMI MD-33","article-title":"SIS\u2014semantics implementation system: Tested examples","author":"Mosses","year":"1979"},{"key":"10.1016\/0167-6423(82)90015-6_BIB23","series-title":"2nd Colloquium Automata, Languages and Programming","first-page":"158","article-title":"Graph representation and computation rules for typeless recursive languages","volume":"14","author":"Pacini","year":"1974"},{"key":"10.1016\/0167-6423(82)90015-6_BIB24","series-title":"The Y combinator in Scott's lambda-calculus models","author":"Park","year":"1970"},{"key":"10.1016\/0167-6423(82)90015-6_BIB25","series-title":"Semantics-Directed Compiler Generation","first-page":"94","article-title":"From standard to implementation denotational semantics","volume":"94","author":"Raskovsky","year":"1980"},{"issue":"3","key":"10.1016\/0167-6423(82)90015-6_BIB26","doi-asserted-by":"crossref","first-page":"484","DOI":"10.1145\/322017.322028","article-title":"Semantics of the domain of flow diagrams","volume":"24","author":"Reynolds","year":"1977","journal-title":"J. ACM"},{"key":"10.1016\/0167-6423(82)90015-6_BIB27","series-title":"Symposium on Semantics of Algorithmic Languages","first-page":"311","article-title":"The lattice of flow diagrams","volume":"188","author":"Scott","year":"1971"},{"key":"10.1016\/0167-6423(82)90015-6_BIB28","first-page":"157","article-title":"Lattice theoretic models for various type-free calculi","author":"Scott","year":"1973"},{"issue":"3","key":"10.1016\/0167-6423(82)90015-6_BIB29","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\/0167-6423(82)90015-6_BIB30","series-title":"Graph-Grammars and Their Application to Computer Science and Biology","first-page":"440","article-title":"A graph-like lambda calculus for which leftmost-outermost reduction is optimal","volume":"73","author":"Staples","year":"1979"},{"key":"10.1016\/0167-6423(82)90015-6_BIB31","series-title":"Denotational Semantics","author":"Stoy","year":"1977"},{"key":"10.1016\/0167-6423(82)90015-6_BIB32","series-title":"International Computing Symposium","first-page":"222","article-title":"Varieties of programming language","author":"Strachey","year":"1972"},{"key":"10.1016\/0167-6423(82)90015-6_BIB33","series-title":"CSTR 84","article-title":"Classes: An abstract data type facility for the C language","author":"Stroustrup","year":"1980"},{"issue":"8","key":"10.1016\/0167-6423(82)90015-6_BIB34","doi-asserted-by":"crossref","first-page":"437","DOI":"10.1145\/360303.360308","article-title":"The denotational semantics of programming languages","volume":"19","author":"Tennent","year":"1976","journal-title":"Comm. ACM"},{"issue":"1","key":"10.1016\/0167-6423(82)90015-6_BIB35","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1002\/spe.4380090105","article-title":"A new implementation technique for applicative languages","volume":"9","author":"Turner","year":"1979","journal-title":"Software\u2014Practice and Experience"},{"issue":"3","key":"10.1016\/0167-6423(82)90015-6_BIB36","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's D\u221e-models of the lambda calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"issue":"3","key":"10.1016\/0167-6423(82)90015-6_BIB37","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/0207028","article-title":"Approximate reductions and lambda calculus models","volume":"7","author":"Wadsworth","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0167-6423(82)90015-6_BIB38","series-title":"TR 94","article-title":"Deriving target code as a representation of continuation semantics","author":"Wand","year":"1980"},{"key":"10.1016\/0167-6423(82)90015-6_BIB39","series-title":"\u03bb-Calculus and Computer Science Theory","first-page":"122","article-title":"Continuous semantics and inside-out reductions","volume":"37","author":"Welch","year":"1975"}],"container-title":["Science of Computer Programming"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642382900156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0167642382900156?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:29:26Z","timestamp":1555090166000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0167642382900156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,5]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1982,5]]}},"alternative-id":["0167642382900156"],"URL":"https:\/\/doi.org\/10.1016\/0167-6423(82)90015-6","relation":{},"ISSN":["0167-6423"],"issn-type":[{"value":"0167-6423","type":"print"}],"subject":[],"published":{"date-parts":[[1982,5]]}}}