{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:53:16Z","timestamp":1725663196497},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540503255"},{"type":"electronic","value":"9783540459705"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1988]]},"DOI":"10.1007\/3-540-50325-0_8","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T15:21:25Z","timestamp":1330183285000},"page":"154-169","source":"Crossref","is-referenced-by-count":15,"title":["Algebraic specifications of reachable higher-order algebras"],"prefix":"10.1007","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[]},{"given":"Andrzej","family":"Tarlecki","sequence":"additional","affiliation":[]},{"given":"Martin","family":"Wirsing","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-61807-9","volume-title":"Algorithmic Language and Program Development","author":"F. L. Bauer","year":"1982","unstructured":"F.L. Bauer, H. W\u00f6ssner: Algorithmic Language and Program Development. Berlin: Springer, 1982."},{"key":"8_CR2","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1016\/0304-3975(84)90086-0","volume":"33","author":"M. Broy","year":"1984","unstructured":"M. Broy, C. Pair, M. Wirsing: A systematic study of models of abstract data Types. Theoretical Computer Science 33, 1984, 139\u2013174.","journal-title":"Theoretical Computer Science"},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"M. Broy: Partial interpretations of higher order algebraic types. Lecture Notes of the International Summer School on Logic of Programming and Calculi of Discrete Design, Marktoberdorf, 1986.","DOI":"10.1007\/BFb0016232"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"292","DOI":"10.1007\/3-540-10007-5_41","volume-title":"The semantics of CLEAR, a specification language","author":"R. M. Burstall","year":"1980","unstructured":"R.M. Burstall, J.A. Goguen: The semantics of CLEAR, a specification language. Proc. Advanced Course on Abstract Software Specifications, Copenhagen. Lecture Notes in Computer Science 86, Berlin: Springer, 1980, 292\u2013332."},{"key":"8_CR5","unstructured":"P. Dybjer: Category-theoretic logics and algebras of programs. Chalmers University of Technology at G\u00f6teborg, Dept. of Computer Science, Ph. D. Thesis, 1983."},{"key":"8_CR6","series-title":"EATCS Monographs on Theoretical Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-69962-7","volume-title":"Fundamentals of Algebraic Specification 1","author":"H. Ehrig","year":"1985","unstructured":"H. Ehrig, B. Mahr: Fundamentals of Algebraic Specification 1. EATCS Monographs on Theoretical Computer Science 6, Berlin: Springer, 1985."},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"J.A. Goguen, R.M. Burstall: Introducing institutions. Proc. Logics of Programming Workshop, Carnegie-Mellon, Lecture Notes in Ccomputer Science 164, Springer 1984, 221\u2013256.","DOI":"10.1007\/3-540-12896-4_366"},{"key":"8_CR8","unstructured":"H.J. Keisler: Model Theory for Infinitary Logic. Studies in Logic and Foundations of Mathematics, Vol. 62, 1971."},{"key":"8_CR9","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1016\/0304-3975(84)90125-7","volume":"31","author":"B. Mahr","year":"1984","unstructured":"B. Mahr, J.A. Makowsky: Characterising specification languages which admit initial semantics, Theoretical Computer Science 31, 1984, 49\u201359.","journal-title":"Theoretical Computer Science"},{"key":"8_CR10","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/BF00995808","volume":"9","author":"T. S. E. E. Maibaum","year":"1980","unstructured":"T.S.E. Maibaum, C.J. Lucena: Higher order data types. Journal of Computer and Information Sciences 9, 1980, 31\u201353.","journal-title":"Journal of Computer and Information Sciences"},{"key":"8_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(77)90053-6","volume":"4","author":"R. Milner","year":"1977","unstructured":"R. Milner: Fully abstract semantics of typed \u03bb-calculi. Theoretical Computer Science 4, 1977, 1\u201322.","journal-title":"Theoretical Computer Science"},{"key":"8_CR12","first-page":"367","volume-title":"Algebraic specifications with higher-order operators","author":"B. M\u00f6ller","year":"1987","unstructured":"B. M\u00f6ller: Algebraic specifications with higher-order operators. In: L. Meertens (ed.): Proc. IFIP TC2 Working Conference on Program Specification and Transformation, Bad T\u00f6lz, April 1986. Amsterdam: North-Holland, 1987, 367\u2013392."},{"key":"8_CR13","unstructured":"B. M\u00f6ller: Higher-order algebraic specifications. Fakult\u00e4t f\u00fcr Mathematik und Informatik der TU M\u00fcnchen, Habilitationsschrift, 1987."},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1007\/BFb0026101","volume-title":"Algebraic specification with built-in domain constructions","author":"B. M\u00f6ller","year":"1988","unstructured":"B. M\u00f6ller, A. Tarlecki, M. Wirsing: Algebraic specification with built-in domain constructions. In: M. Dauchet, M. Nivat (eds.): Proc. 13th Colloquium on Trees in Algebra and Programming, Nancy, March 1988. Lecture Notes in Computer Science 299. Berlin: Springer 1988, 132\u2013148."},{"key":"8_CR15","unstructured":"K. Parsaye-Ghomi: Higher-order abstract data types. Dept. of Computer Science, University of California at Los Angeles, Ph. D. Thesis, 1981."},{"key":"8_CR16","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1016\/0304-3975(77)90044-5","volume":"4","author":"G. D. Plotkin","year":"1977","unstructured":"G.D. Plotkin: LCF considered as a programming language. Theoretical Computer Science 4, 1977, 223\u2013255.","journal-title":"Theoretical Computer Science"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1007\/3-540-12920-0_16","volume-title":"Higher-order data structures \u2014 Cartesian closure versus \u03bb-calculus","author":"A. Poign\u00e9","year":"1984","unstructured":"A. Poign\u00e9: Higher-order data structures \u2014 Cartesian closure versus \u03bb-calculus. Proc. Symposium on Theoretical Aspects of Computer Science 1984. Lecture Notes in Computer Science 166. Berlin: Springer, 1984, 174\u2013185."},{"key":"8_CR18","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0019-9958(86)80027-4","volume":"68","author":"A. Poign\u00e9","year":"1986","unstructured":"A. Poign\u00e9: On specifications, theories, and models with higher types. Information and Control 68, 1986, 1\u201346.","journal-title":"Information and Control"},{"key":"8_CR19","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1016\/0304-3975(85)90094-5","volume":"37","author":"A. Tarlecki","year":"1985","unstructured":"A. Tarlecki: On the existence of free models in abstract algebraic institutions, Theoretical Computer Science 37, 1985, 269\u2013304.","journal-title":"Theoretical Computer Science"},{"key":"8_CR20","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0022-0000(86)90057-7","volume":"33","author":"A. Tarlecki","year":"1986","unstructured":"A. Tarlecki: Quasi-varieties in abstract algebraic institutions, Journal of Computer and System Sciences 33, 1986, 333\u2013360.","journal-title":"Journal of Computer and System Sciences"},{"key":"8_CR21","doi-asserted-by":"crossref","first-page":"95","DOI":"10.3233\/FI-1986-9106","volume":"9","author":"A. Tarlecki","year":"1986","unstructured":"A. Tarlecki, M. Wirsing: Continuous abstract data types. Fundamenta Informaticae 9, 1986, 95\u2013125.","journal-title":"Fundamenta Informaticae"}],"container-title":["Lecture Notes in Computer Science","Recent Trends in Data Type Specification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-50325-0_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,30]],"date-time":"2021-12-30T21:35:09Z","timestamp":1640900109000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-50325-0_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1988]]},"ISBN":["9783540503255","9783540459705"],"references-count":21,"URL":"http:\/\/dx.doi.org\/10.1007\/3-540-50325-0_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1988]]}}}
