{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T17:03:57Z","timestamp":1725469437643},"publisher-location":"Berlin\/Heidelberg","reference-count":15,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"0387972889"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0043083","type":"book-chapter","created":{"date-parts":[[2006,8,17]],"date-time":"2006-08-17T16:46:04Z","timestamp":1155833164000},"page":"161-180","source":"Crossref","is-referenced-by-count":0,"title":["Optimal semantics of data type extensions"],"prefix":"10.1007","author":[{"given":"Lawrence S.","family":"Moss","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Satish R.","family":"Thatte","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"9_CR1","unstructured":"J. A. Goguen, J. W. Thatcher, E. G. Wagner, and J.B. Wright (ADJ). An initial algebra approach to the specification, correctness, and implementation of abstract data types. In R. T. Yeh, editor, Current Trends in Programming Methodology IV. Prentice-Hall, 1978."},{"issue":"1","key":"9_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/BF00260922","volume":"10","author":"J. V. Guttag","year":"1978","unstructured":"J. V. Guttag and J. J. Horning. The algebraic specification of abstract data types. Acta Informatica, 10(1):27\u201352, 1978.","journal-title":"Acta Informatica"},{"issue":"1","key":"9_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/357153.357158","volume":"4","author":"M. C. Hoffman","year":"1982","unstructured":"M. C. Hoffman and M. J. O'Donnell. Programming with equations. ACM TOPLAS, 4(1):83\u2013112, 1982.","journal-title":"ACM TOPLAS"},{"issue":"1","key":"9_CR4","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/357195.357202","volume":"5","author":"S. Kamin","year":"1983","unstructured":"S. Kamin. Final data types and their specifications. ACM TOPLAS, 5(1):97\u2013121, 1983.","journal-title":"ACM TOPLAS"},{"key":"9_CR5","unstructured":"D. Kapur and D. R. Musser. Proof by consistency. General Electric Corporate Research and Development Report 84 GEN008, 1984."},{"key":"9_CR6","unstructured":"D. Kapur and D. R. Musser. Inductive reasoning with incomplete specifications. In Proceedings of the Symposium on Logic in Computer Science, pages 367\u2013377, 1986."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner. Fully abstract models of typed \u03bb-calculi. Theoretical Computer Science, 4:1\u201322, 1977.","journal-title":"Theoretical Computer Science"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"R. Milner. A proposal for standard ML. In Proc. 1984 Symp. on LISP and Functional Programming, pages 184\u2013197. ACM, 1984.","DOI":"10.1145\/800055.802035"},{"key":"9_CR9","unstructured":"L. S. Moss, J. Meseguer, and J. A. Goguen. Final algebras, cosemicomputable algebras, and degrees of unsolvability. Theoretical Computer Science, To Appear."},{"key":"9_CR10","first-page":"255","volume":"15","author":"M. Nivat","year":"1975","unstructured":"M. Nivat. On the interpretation of recursive polyadic program schemes. Symposia Mathematica, 15:255\u2013281, 1975.","journal-title":"Symposia Mathematica"},{"issue":"4","key":"9_CR11","doi-asserted-by":"crossref","first-page":"772","DOI":"10.1145\/322217.322229","volume":"27","author":"J. C. Raoult","year":"1980","unstructured":"J. C. Raoult and J. C. Vuillemin. Operational and semantic equivalence between recursive programs. J. Assoc. Comp. Mach., 27(4):772\u2013776, 1980.","journal-title":"J. Assoc. Comp. Mach."},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"S. R. Thatte. Full abstraction and limiting completeness in equational languages. Theoretical Computer Science, 65(1), 1989.","DOI":"10.1016\/0304-3975(89)90139-4"},{"key":"9_CR13","doi-asserted-by":"crossref","unstructured":"D. A. Turner. Miranda: A non-strict functional language with polymorphic types. In LNCS 201. Springer-Verlag, 1985.","DOI":"10.1007\/3-540-15975-4_26"},{"issue":"3","key":"9_CR14","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1137\/0205036","volume":"5","author":"C. Wadsworth","year":"1976","unstructured":"C. Wadsworth. The relation between computational and denotational properties for Scott's D\u221e models of the \u03bb-calculus. SIAM Journal of Computing, 5(3):488\u2013520, 1976.","journal-title":"SIAM Journal of Computing"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","volume":"19","author":"M. Wand","year":"1977","unstructured":"M. Wand. Final algebra semantics and data type extensions. Journal of Computer and System Sciences, 19(1):27\u201344, 1977.","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algebraic Logic and Universal Algebra in Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0043083.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:47:02Z","timestamp":1607550422000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0043083"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["0387972889"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/bfb0043083","relation":{},"subject":[]}}