{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T08:49:27Z","timestamp":1672735767894},"reference-count":25,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[1987,4,1]],"date-time":"1987-04-01T00:00:00Z","timestamp":544233600000},"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":9604,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1987,4]]},"DOI":"10.1016\/0022-0000(87)90029-8","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T07:01:00Z","timestamp":1070521260000},"page":"340-376","source":"Crossref","is-referenced-by-count":9,"title":["On the implementation of abstract data types by programming language constructs"],"prefix":"10.1016","volume":"34","author":[{"given":"Axel","family":"Poign\u00e9","sequence":"first","affiliation":[]},{"given":"Josef","family":"Voss","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(87)90029-8_BIB1","article-title":"An initial algebra approach to the specification, correctness and implementation of abstract data types","author":"Goguen","year":"1978"},{"key":"10.1016\/0022-0000(87)90029-8_BIB2","series-title":"The Lambda Calculus","author":"Barendregt","year":"1984"},{"key":"10.1016\/0022-0000(87)90029-8_BIB3","series-title":"Rapport de Recherche No. 197","article-title":"Full abstraction for sequential languages: The state of the art","author":"Berry","year":"1983"},{"key":"10.1016\/0022-0000(87)90029-8_BIB4","doi-asserted-by":"crossref","first-page":"304","DOI":"10.1016\/0022-0000(83)90045-4","article-title":"Implementation of data types by algebraic methods","volume":"27","author":"Blum","year":"1983","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0022-0000(87)90029-8_BIB5","series-title":"Proceedings, 5\u00e9me Coloque de Lille","article-title":"Programming languages as abstract data types","author":"Broy","year":"1980"},{"key":"10.1016\/0022-0000(87)90029-8_BIB6","article-title":"Generalized Algebraic Theories and Contextual Categories","author":"Cartmell","year":"1978"},{"key":"10.1016\/0022-0000(87)90029-8_BIB7","series-title":"Categorical Combinators, Sequential Algorithms and Functional Programming","author":"Curien","year":"1986"},{"key":"10.1016\/0022-0000(87)90029-8_BIB8","doi-asserted-by":"crossref","DOI":"10.1016\/S0304-3975(82)80001-7","article-title":"Algebraic implementation of abstract data types","volume":"20","author":"Ehrig","year":"1982","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(87)90029-8_BIB9_1","article-title":"Parameter passing in algebraic specification languages","author":"Ehrig","year":"1984","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(87)90029-8_BIB9_2","series-title":"Proceedings ICALP'80","article-title":"Parameter passing in algebraic specification languages","volume":"Vol. 95","author":"Kreowski","year":"1980"},{"key":"10.1016\/0022-0000(87)90029-8_BIB10","doi-asserted-by":"crossref","DOI":"10.1145\/322358.322370","article-title":"The expressiveness of simple and second order type structures","volume":"30","author":"Fortune","year":"1983","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0022-0000(87)90029-8_BIB11","series-title":"Bericht Nr. TUM 18110","article-title":"Parameterized Specifications: Parameter Passing and Optimizing Implementation","author":"Ganzinger","year":"1981"},{"key":"10.1016\/0022-0000(87)90029-8_BIB12","series-title":"Introduction to Higher Order Categorical Logic","author":"Lambeck","year":"1986"},{"key":"10.1016\/0022-0000(87)90029-8_BIB13","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(76)90009-8","article-title":"An algebraic interpretation of the \u03bb-\u03b2-\u03ba-calculus and an application of a labeled lambda calculus","volume":"2","author":"Levy","year":"1976","journal-title":"Theoret. Comput. Sci."},{"key":"10.1016\/0022-0000(87)90029-8_BIB14","article-title":"Ein algebraischer Kalkuel fuer einen strukturierten Entwurf von Datenabstraktionen","author":"Lipeck","year":"1983"},{"key":"10.1016\/0022-0000(87)90029-8_BIB15","doi-asserted-by":"crossref","DOI":"10.1016\/0304-3975(82)90109-8","article-title":"Abstract data types and algebraic semantics of programming languages","volume":"18","author":"Pair","year":"1982","journal-title":"Theoret. Comput Sci."},{"key":"10.1016\/0022-0000(87)90029-8_BIB16","series-title":"Proc. MFCS'84","article-title":"Another look at parameterization using algebraic specifications with subsorts","volume":"176","author":"Poign\u00e9","year":"1984"},{"key":"10.1016\/0022-0000(87)90029-8_BIB17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80027-4","article-title":"On specifications, theories and models with higher types","volume":"68","author":"Poign\u00e9","year":"1986","journal-title":"Inform. and Control"},{"key":"10.1016\/0022-0000(87)90029-8_BIB18","series-title":"Programs over Algebraic Specifications\u2014On the Implementation of Abstract Data Types","author":"Poign\u00e9","year":"1983"},{"key":"10.1016\/0022-0000(87)90029-8_BIB19","series-title":"Proceedings CAAP'85","article-title":"On the implementation of abstract data types by programming language constructs","volume":"Vol. 185","author":"Poign\u00e9","year":"1985"},{"key":"10.1016\/0022-0000(87)90029-8_BIB20","series-title":"The Church-Rosser theorem for the typed \u03bb-calculus with extensional pairing","author":"Pottinger","year":"1979"},{"key":"10.1016\/0022-0000(87)90029-8_BIB21","series-title":"Combinators, Lambda Terms, and Proof Theory","author":"Stenlund","year":"1972"},{"key":"10.1016\/0022-0000(87)90029-8_BIB22","doi-asserted-by":"crossref","DOI":"10.2307\/2271658","article-title":"Intensional interpretation of functionals of finite type","volume":"32","author":"Tait","year":"1967","journal-title":"J. Symbolic Logic"},{"key":"10.1016\/0022-0000(87)90029-8_BIB23","series-title":"Programme \u00fcber algebraischen Spezifikationen\u2014Zur Implementierung von Abstrakten Datentypen, Diplomarbeit","author":"Voss","year":"1983"},{"key":"10.1016\/0022-0000(87)90029-8_BIB24","series-title":"Proceedings Intl. Conference Foundations of Computation Theory","article-title":"A kernel language for algebraic specification and implementation","volume":"Vol. 158","author":"Sannella","year":"1983"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000087900298?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000087900298?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T08:53:15Z","timestamp":1550307195000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000087900298"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,4]]},"references-count":25,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[1987,4]]}},"alternative-id":["0022000087900298"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(87)90029-8","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1987,4]]}}}