{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,9]],"date-time":"2026-05-09T04:29:44Z","timestamp":1778300984080,"version":"3.51.4"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1985,12,1]],"date-time":"1985-12-01T00:00:00Z","timestamp":502243200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[1985,12]]},"DOI":"10.1007\/bf00267044","type":"journal-article","created":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:38:04Z","timestamp":1688488684000},"page":"537-578","source":"Crossref","is-referenced-by-count":26,"title":["On the algebraic specification of infinite objects \u2014 ordered and continuous models of algebraic types"],"prefix":"10.1007","volume":"22","author":[{"given":"Bernhard","family":"M\u00f6ller","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF00267044_CR1","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"Backus, J.: Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Commun. ACM 21, 613\u2013641 (1978)","journal-title":"Commun. ACM"},{"key":"BF00267044_CR2","unstructured":"Bauer, F.L.: Algorithmische Sprachen. Vorlesungsskriptum, Kap. 1\u20133. Institut f\u00fcr Informatik der TU M\u00fcnchen, July 1977"},{"key":"BF00267044_CR3","series-title":"Lect. Notes Comput. Sci., vol. 69","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1007\/BFb0014675","volume-title":"Program construction","author":"F.L. Bauer","year":"1979","unstructured":"Bauer, F.L.: Detailization and lazy evaluation, infinite objects and pointer representation. In: Program construction (F.L. Bauer, M. Broy, eds.), pp. 406\u2013420. Lect. Notes Comput. Sci., vol. 69. Berlin: Springer 1979"},{"key":"BF00267044_CR4","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":"Bauer, F.L., W\u00f6ssner, H.: Algorithmic Language and Program Development. Berlin: Springer 1982"},{"key":"BF00267044_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-15187-7","volume-title":"The Munich project CIP, vol. I: The wide spectrum language CIP-L. Lect. Notes Comput. Sci., vol. 183","author":"F.L. Bauer","year":"1985","unstructured":"Bauer, F.L., Berghammer, R., Broy, M., Dosch, W., Geiselbrechtinger, F., Gnatz, R., Hangel, E., Hesse, W., Krieg-Br\u00fcckner, B., Laut, A., Matzner, T., M\u00f6ller, B., Nickl, F., Partsch, H., Pepper, P., Samelson, K., Wirsing, M.: The Munich project CIP, vol. I: The wide spectrum language CIP-L. Lect. Notes Comput. Sci., vol. 183. Berlin: Springer 1985"},{"key":"BF00267044_CR6","volume-title":"Am. Math. Soc. Coll. Publ., vol. XXV","author":"G. Birkhoff","year":"1967","unstructured":"Birkhoff, G.: Lattice theory (3rd edition). Am. Math. Soc. Coll. Publ., vol. XXV. Providence, R.I.: AMS 1967","edition":"3rd edition"},{"key":"BF00267044_CR7","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/S0021-9800(70)80014-X","volume":"8","author":"G. Birkhoff","year":"1970","unstructured":"Birkhoff, G., Lipson, J.D.: Heterogeneous algebras. J. Comb. Theory 8, 115\u2013133 (1970)","journal-title":"J. Comb. Theory"},{"issue":"3\u20134","key":"BF00267044_CR8","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1007\/BF01894874","volume":"17","author":"M.N. Bleicher","year":"1966","unstructured":"Bleicher, M.N., Schneider, H.: Completions of partially ordered sets and universal algebras. Acta Math. Acad. Sci. Hung. Tomus 17 (3\u20134), 271\u2013301 (1966)","journal-title":"Acta Math. Acad. Sci. Hung. Tomus"},{"key":"BF00267044_CR9","series-title":"Lect. Notes Comput. Sci., vol. 176","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1007\/BFb0030301","volume-title":"Mathematical Foundations of Computer Science 1984","author":"M. Broy","year":"1984","unstructured":"Broy, M.: On the Herbrand Kleene universe for nondeterministic computations. In: Mathematical Foundations of Computer Science 1984 (M.P. Chytil, V. Koubek, eds.), pp. 214\u2013222. Lect. Notes Comput. Sci., vol. 176. Berlin: Springer 1984"},{"key":"BF00267044_CR10","unstructured":"Broy, M., Wirsing, M.: Initial versus terminal algebra semantics for partially defined abstract types. Institut f\u00fcr Informatik der TU M\u00fcnchen, TUM-I8018, 1980"},{"key":"BF00267044_CR11","doi-asserted-by":"crossref","unstructured":"Courcelle, B., Nivat, M.: Algebraic families of interpretations. Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, Houston, Tex., 137\u2013146 (Oct. 25\u201327, 1976)","DOI":"10.1109\/SFCS.1976.3"},{"key":"BF00267044_CR12","unstructured":"Delgado Kloos, C., Dosch, W., M\u00f6ller, B.: An algebra of agents. Proc. VI Congreso de Inform\u00e1tica y Autom\u00e1tica, Madrid, 15\u201318 October (To appear). Extended version: Delgado Kloos, C., Dosch, W., M\u00f6ller, B.: Algebraic specification of a Language for describing communicating agents. Institut f\u00fcr Informatik der TU M\u00fcnchen, TUM-I8510, 1985"},{"key":"BF00267044_CR13","series-title":"Informatik-Fachberichte, vol. 73","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1007\/978-3-642-69298-7_7","volume-title":"GI-13. Jahrestagung","author":"W. Dosch","year":"1983","unstructured":"Dosch, W., M\u00f6ller, B.: An algebraic semantics for Backus' functional programming language with infinite objects. In: GI-13. Jahrestagung (I. Kupka, ed.), pp. 67\u201385. Informatik-Fachberichte, vol. 73. Berlin: Springer 1983"},{"key":"BF00267044_CR14","doi-asserted-by":"crossref","unstructured":"Dosch, W., M\u00f6ller, B.: Lazy and busy FP with infinite objects. Proc. 1984 ACM Symposium on LISP and Functional Programming, Austin, Tex., pp. 282\u2013292 (August 6\u20138, 1984)","DOI":"10.1145\/800055.802045"},{"key":"BF00267044_CR15","doi-asserted-by":"crossref","first-page":"167","DOI":"10.1016\/0304-3975(83)90098-1","volume":"27","author":"H.-D. Ehrich","year":"1983","unstructured":"Ehrich, H.-D., Lipeck, U.: Algebraic domain equations. Theor. Comput. Sci. 27, 167\u2013196 (1983)","journal-title":"Theor. Comput. Sci."},{"key":"BF00267044_CR16","first-page":"257","volume-title":"Automata, languages and programming","author":"D.P. Friedman","year":"1976","unstructured":"Friedman, D.P., Wise, D.S.: CONS should not evaluate its arguments. In: Automata, languages and programming (S. Michaelson, R. Milner, eds.), pp. 257\u2013285. Edinburgh: Edinburgh University Press 1976"},{"key":"BF00267044_CR17","first-page":"491","volume-title":"Formal description of programming concepts","author":"J.A. Goguen","year":"1978","unstructured":"Goguen, J.A.: Abstract errors for abstract data types. In: Formal description of programming concepts (E.J. Neuhold, ed.), pp. 491\u2013525. Amsterdam: North-Holland 1978"},{"key":"BF00267044_CR18","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1145\/321992.321997","volume":"24","author":"J.A. Goguen","year":"1977","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G., Wright, J.B.: Initial algebra semantics and continuous algebras. J. ACM 24, 68\u201395 (1977)","journal-title":"J. ACM"},{"key":"BF00267044_CR19","first-page":"80","volume-title":"Current trends in programming methodology, vol. 3: Data structuring","author":"J.A. Goguen","year":"1978","unstructured":"Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness, and implementation of abstract data types. In: Current trends in programming methodology, vol. 3: Data structuring (R.T. Yeh, ed.), pp. 80\u2013149. Englewood Cliffs, N.J.: Prentice Hall 1978"},{"key":"BF00267044_CR20","unstructured":"Guttag, J.V.: The specification and application to programming of abstract data types. PH.D. Thesis, University of Toronto, Department of Computer Science, Rep. CSRG-59, 1975"},{"key":"BF00267044_CR21","doi-asserted-by":"crossref","unstructured":"Henderson, P., Morris, J.H.: A lazy evaluator. Proc. 3rd ACM Symposium on Principles of Programming Languages, pp. 95\u2013103 (1976)","DOI":"10.1145\/800168.811543"},{"key":"BF00267044_CR22","unstructured":"Hennessy, M., Milner, R.: Algebraic laws for nondeterminism and concurrency. University of Edinburgh, Department of Computer Science, Internal Report CSR-133\u201383, June 1983"},{"key":"BF00267044_CR23","unstructured":"Laut, A.: Von abstrakter Syntax zu verketteten B\u00e4umen \u2014 Entwicklung einer Rechenstruktur f\u00fcr die Programm-Manipulation. Institut f\u00fcr Informatik der TU M\u00fcnchen, TUM-I8114, 1981"},{"key":"BF00267044_CR24","series-title":"Informatik-Fachberichte, vol. 43","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/978-3-642-68064-9_2","volume-title":"Werkzeuge der Programmiertechnik","author":"A. Laut","year":"1981","unstructured":"Laut, A.: Developing algebraic specifications of threaded data structure implementations. In: Werkzeuge der Programmiertechnik (G. Goos, ed.), pp. 28\u201340. Informatik-Fachberichte, vol. 43. Berlin: Springer 1981"},{"key":"BF00267044_CR25","unstructured":"Levy, M.R.: Data types with sharing and circularity. Ph.D. Thesis, University of Waterloo, Department of Computer Science 1978"},{"key":"BF00267044_CR26","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1137\/0211016","volume":"11","author":"M.R. Levy","year":"1982","unstructured":"Levy, M.R., Maibaum, T.S.E.: Continuous data types. SIAM J. Comput. 11, 201\u2013216 (1982)","journal-title":"SIAM J. Comput."},{"key":"BF00267044_CR27","doi-asserted-by":"crossref","unstructured":"Markowsky, G., Rosen, B.: Bases for chain-complete posets. Proc. 16th Annual Symposium on Foundations of Computer Science, Berkeley, pp. 34\u201347 (Oct. 13\u201315, 1975)","DOI":"10.1109\/SFCS.1975.7"},{"key":"BF00267044_CR28","doi-asserted-by":"crossref","first-page":"184","DOI":"10.1145\/367177.367199","volume":"3","author":"J. McCarthy","year":"1960","unstructured":"McCarthy, J.: Recursive functions of symbolic expressions and their computation by machine, Part I. Commun. ACM 3, 184\u2013195 (1960)","journal-title":"Commun. ACM"},{"key":"BF00267044_CR29","volume-title":"Lect. Notes Comput. Sci., vol. 92","author":"R. Milner","year":"1980","unstructured":"Milner, R.: A calculus of communicating systems. Lect. Notes Comput. Sci., vol. 92. Berlin: Springer 1980"},{"key":"BF00267044_CR30","unstructured":"M\u00f6ller, B.: Unendliche Objekte und Geflechte. Fakult\u00e4t f\u00fcr Mathematik und Informatik der TU M\u00fcnchen, Dissertation, TUM-I8213, 1982"},{"key":"BF00267044_CR31","series-title":"Lect. Notes Comput. Sci., vol. 154","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1007\/BFb0036933","volume-title":"Automata, languages and programming","author":"B. M\u00f6ller","year":"1983","unstructured":"M\u00f6ller, B.: An algebraic semantics for busy (data-driven) and lazy (demand-driven) evaluation and its application to a functional language. In: Automata, languages and programming (J. Diaz, ed.), pp. 513\u2013526. Lect. Notes Comput. Sci., vol. 154. Berlin: Springer 1983"},{"key":"BF00267044_CR32","unstructured":"M\u00f6ller, B., Dosch, W.: On the algebraic specification of domains. In: Proc. 3rd Workshop on Theory and Application of Abstract Data Types (H.-J. Kreowski, ed.). Informatik-Fachberichte. Berlin, Heidelberg, New York: Springer (To appear)"},{"key":"BF00267044_CR33","first-page":"255","volume-title":"Istituto Nazionale di Alta Matematica, Symposia Matematica XV","author":"M. Nivat","year":"1975","unstructured":"Nivat, M.: On the interpretation of recursive polyadic program schemes. Istituto Nazionale di Alta Matematica, Symposia Matematica XV, pp. 255\u2013281. London: Academic Press 1975"},{"key":"BF00267044_CR34","first-page":"17","volume-title":"Information Processing 80","author":"M. Nivat","year":"1980","unstructured":"Nivat, M.: Nondeterministic programs: An algebraic overview. In: Information Processing 80 (S.H. Lavington, ed.), pp. 17\u201328. Amsterdam: North-Holland 1980"},{"key":"BF00267044_CR35","unstructured":"Pinegger, T.: Verz\u00f6gerte Auswertung von Algorithmen \u00fcber unendlichen Mengen. Institut f\u00fcr Informatik der TU M\u00fcnchen, Diplomarbeit 1982"},{"key":"BF00267044_CR36","doi-asserted-by":"crossref","first-page":"452","DOI":"10.1137\/0205035","volume":"5","author":"G.D. Plotkin","year":"1976","unstructured":"Plotkin, G.D.: A powerdomain construction. SIAM J. Comput. 5, 452\u2013487 (1976)","journal-title":"SIAM J. Comput."},{"key":"BF00267044_CR37","unstructured":"Scott, D.S.: Outline of a mathematical theory of computation. Proc. 4th Annual Princeton Conference on Information Sciences and Systems, pp. 169\u2013176 (1970); Technical Monograph PRG-2, Oxford University, Computing Laboratory, Programming Research Group 1970"},{"key":"BF00267044_CR38","series-title":"Lect. Notes Math., vol. 188","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/BFb0059703","volume-title":"Symposium on the semantics of programming languages","author":"D.S. Scott","year":"1971","unstructured":"Scott, D.S.: The lattice of flow diagrams. In: Symposium on the semantics of programming languages (E. Engeler, ed.), pp. 311\u2013372. Lect. Notes Math., vol. 188. Berlin: Springer 1971"},{"key":"BF00267044_CR39","unstructured":"Tarlecki, A., Wirsing, M.: Continuous abstract data types \u2014 Basic machinery and results. Universit\u00e4t Passau, Fakult\u00e4t f\u00fcr Informatik, January 1985"},{"key":"BF00267044_CR40","unstructured":"Thatcher, J.W., Wagner, E.G., Wright, J.B.: Specification of abstract data types using conditional axioms. IBM Research Report RC6814, 1976"},{"key":"BF00267044_CR41","doi-asserted-by":"crossref","first-page":"332","DOI":"10.1016\/S0022-0000(74)80048-6","volume":"9","author":"J. Vuillemin","year":"1974","unstructured":"Vuillemin, J.: Correct and optimal implementations of recursion in a simple programming language. J. Comput. Syst. Sci. 9, 332\u2013354 (1974)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00267044_CR42","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/0022-0000(79)90011-4","volume":"19","author":"M. Wand","year":"1979","unstructured":"Wand, M.: Final algebra semantics and data type extensions. J. Comput. Syst. Sci. 19, 27\u201344 (1979)","journal-title":"J. Comput. Syst. Sci."},{"key":"BF00267044_CR43","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00264293","volume":"20","author":"M. Wirsing","year":"1983","unstructured":"Wirsing, M., Pepper, P., Partsch, H., Dosch, W., Broy, M.: On hierarchies of abstract data types. Acta Inf. 20, 1\u201333 (1983)","journal-title":"Acta Inf."},{"key":"BF00267044_CR44","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0304-3975(78)90040-3","volume":"7","author":"J.B. Wright","year":"1978","unstructured":"Wright, J.B., Wagner, E.G., Thatcher, J.W.: A uniform approach to inductive posets and inductive closure. Theor. Comput. Sci. 7, 57\u201377 (1978)","journal-title":"Theor. Comput. Sci."}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/BF00267044\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00267044.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,4]],"date-time":"2023-07-04T16:38:33Z","timestamp":1688488713000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BF00267044"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,12]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1985,12]]}},"alternative-id":["BF00267044"],"URL":"https:\/\/doi.org\/10.1007\/bf00267044","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[1985,12]]}}}