{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T11:56:51Z","timestamp":1648641411776},"reference-count":25,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"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":11004,"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":[[1983,6]]},"DOI":"10.1016\/0304-3975(83)90131-7","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:48:55Z","timestamp":1027655335000},"page":"73-94","source":"Crossref","is-referenced-by-count":0,"title":["Approximation properties of abstract data types"],"prefix":"10.1016","volume":"24","author":[{"given":"David A.","family":"Schmidt","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(83)90131-7_BIB1","first-page":"71","article-title":"Minimal and optimal computations of recursive programs","author":"Berry","year":"1973","journal-title":"Proc. 4th ACM Symposium on Principles of Programming Languages"},{"key":"10.1016\/0304-3975(83)90131-7_BIB2","series-title":"Lattice Theory","author":"Birkhoff","year":"1967"},{"key":"10.1016\/0304-3975(83)90131-7_BIB3","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","article-title":"Heterogeneous algebras","volume":"8","author":"Birkhoff","year":"1970","journal-title":"J. Combinatorial Theory"},{"key":"10.1016\/0304-3975(83)90131-7_BIB4","series-title":"Universal Algebra","author":"Cohn","year":"1965"},{"key":"10.1016\/0304-3975(83)90131-7_BIB5_1","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1016\/S0022-0000(77)80034-2","article-title":"IO and OI, Part I","volume":"15","author":"Engelfriet","year":"1977","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90131-7_BIB5_2","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/0022-0000(78)90051-X","article-title":"IO and OI, Part II","volume":"16","author":"Engelfriet","year":"1978","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90131-7_BIB6","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1007\/3-540-09541-1_36","article-title":"Some design principles and theory for OBJ-0","author":"Goguen","year":"1979","journal-title":"Proc. Conference on Mathematical Studies of Information Processing"},{"key":"10.1016\/0304-3975(83)90131-7_BIB7","first-page":"80","article-title":"An initial algebra approach to the specification, correctness, and implementation of abstract data types","volume":"Vol. 4","author":"Goguen","year":"1978"},{"key":"10.1016\/0304-3975(83)90131-7_BIB8","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\/0304-3975(83)90131-7_BIB9","series-title":"Universal Algebra","author":"Gratzer","year":"1967"},{"key":"10.1016\/0304-3975(83)90131-7_BIB10","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1007\/BF00260922","article-title":"The algebraic specification of abstract data types","volume":"10","author":"Guttag","year":"1978","journal-title":"Acta Informat."},{"key":"10.1016\/0304-3975(83)90131-7_BIB11","doi-asserted-by":"crossref","first-page":"1048","DOI":"10.1145\/359657.359666","article-title":"Abstract data types and software validation","volume":"21","author":"Guttag","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(83)90131-7_BIB12","first-page":"131","author":"Kamin","year":"1980","journal-title":"Final data type specifications"},{"key":"10.1016\/0304-3975(83)90131-7_BIB13","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the lambda-beta-K-calculus and a labelled lambda calculus","volume":"2","author":"Levy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0304-3975(83)90131-7_BIB14","series-title":"Mathematical Theory of Computation","author":"Manna","year":"1974"},{"key":"10.1016\/0304-3975(83)90131-7_BIB15","author":"Mosses","year":"1980","journal-title":"A constructive approach to compiler correctness"},{"key":"10.1016\/0304-3975(83)90131-7_BIB16","series-title":"Automata, Languages, and Programming","first-page":"293","article-title":"Languages algebraic sur le magma libre et s\u00e9mantique des sch\u00e9mes de programme","author":"Nivat","year":"1973"},{"key":"10.1016\/0304-3975(83)90131-7_BIB17","series-title":"Computing in Systems Described by Equations","author":"O'Donnell","year":"1977"},{"key":"10.1016\/0304-3975(83)90131-7_BIB18","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1145\/321738.321750","article-title":"Tree manipulating systems and Church-Rosser theorems","volume":"20","author":"Rosen","year":"1973","journal-title":"J. ACM"},{"key":"10.1016\/0304-3975(83)90131-7_BIB19","series-title":"Ph.D. Thesis","article-title":"Compiler generation from lambda calculus definitions of programming languages","author":"Schmidt","year":"1981"},{"key":"10.1016\/0304-3975(83)90131-7_BIB20","series-title":"Denotational Semantics","author":"Stoy","year":"1977"},{"key":"10.1016\/0304-3975(83)90131-7_BIB21","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1137\/0205036","article-title":"The relation between computational and denotational properties for Scott's models of the lambda calculus","volume":"5","author":"Wadsworth","year":"1976","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90131-7_BIB22","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1137\/0207028","article-title":"Approximate reduction and lambda calculus models","volume":"7","author":"Wadsworth","year":"1978","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(83)90131-7_BIB23","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","article-title":"Final algebra semantics and data type extensions","volume":"19","author":"Wand","year":"1979","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0304-3975(83)90131-7_BIB24","first-page":"122","author":"Welch","year":"1975","journal-title":"Continuous semantics and inside-out reductions"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901317?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397583901317?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:28:10Z","timestamp":1555126090000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397583901317"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":25,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["0304397583901317"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(83)90131-7","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}