{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:20:27Z","timestamp":1725484827023},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540430759"},{"type":"electronic","value":"9783540455752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45575-2_45","type":"book-chapter","created":{"date-parts":[[2007,5,30]],"date-time":"2007-05-30T21:30:22Z","timestamp":1180560622000},"page":"468-481","source":"Crossref","is-referenced-by-count":1,"title":["Abstract Computability of Non-deterministic Programs over Various Data Structures"],"prefix":"10.1007","author":[{"given":"Nikolaj S.","family":"Nikitchenko","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,12,18]]},"reference":[{"key":"45_CR1","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1007\/3-540-11157-3_38","volume-title":"Algorithms in modern mathematics and computer science","author":"A.P. Ershov","year":"1981","unstructured":"A.P. Ershov. Abstract computability on algebraic structures. In: A.P. Ershov, D. Knuth (Eds) Algorithms in modern mathematics and computer science. Berlin: Springer (1981) 397\u2013420"},{"key":"45_CR2","first-page":"3","volume":"19","author":"A.P. Ershov","year":"1982","unstructured":"A.P. Ershov. Computability in arbitrary domains and bases. Semiotics and Informatics, No. 19 (1982) 3\u201358. In Russian.","journal-title":"Semiotics and Informatics"},{"key":"45_CR3","unstructured":"N.S. Nikitchenko. On the construction of classes of generalized computable functions and functionals, UkrNIINTI, techn. report No 856 Uk-84, Kiev (1984) 51 p. In Russian."},{"key":"45_CR4","unstructured":"I.A. Basarab, N.S. Nikitchenko, V.N. Red\u2019ko. Composition databases, Kiev, Lybid\u2019 (1992) 192 p. In Russian."},{"key":"45_CR5","unstructured":"N. Nikitchenko. A composition nominative approach to program semantics. Technical Report IT-TR: 1998-020. Technical University of Denmark (1998) 103 p."},{"key":"45_CR6","first-page":"3","volume":"5","author":"V.N. Redko","year":"1978","unstructured":"V.N. Red\u2019ko. Composition of programs and composition programming. Programmirovanie, No 5 (1978) 3\u201324. In Russian.","journal-title":"Programmirovanie"},{"issue":"1","key":"45_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(92)90296-R","volume":"102","author":"K. Grue","year":"1992","unstructured":"K. Grue. Map theory. Theoretical Computer Science, v. 102(1) (1992) 1\u2013133","journal-title":"Theoretical Computer Science"},{"key":"45_CR8","unstructured":"M. Atkinson, et. al. The object-oriented database system manifesto. DOOD\u201989 (1989) 40\u201357"},{"key":"45_CR9","unstructured":"R. Gandy. Church\u2019s thesis and principles for mechanisms. The Kleene Symp. Eds. J. Barwise, et. al, Amsterdam: North-Holland (1980) 123\u2013148"},{"key":"45_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"577","DOI":"10.1007\/BFb0012801","volume-title":"Domains for denotational semantics","author":"D. Scott","year":"1982","unstructured":"D. Scott. Domains for denotational semantics. LNCS, v. 140 (1982) 577\u2013613"},{"key":"45_CR11","doi-asserted-by":"crossref","unstructured":"Y.N. Moschovakis. Abstract recursion as a foundation for the theory of algorithms. Lect. Notes Math, v. 1104 (1984) 289\u2013362","DOI":"10.1007\/BFb0099491"},{"key":"45_CR12","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/BF00288773","volume":"22","author":"A.J. Kfoury","year":"1985","unstructured":"A.J. Kfoury, P. Urzyczyn. Necessary and sufficient conditions for the universality of programming formalism. Acta Informatica, v. 22 (1985) 347\u2013377","journal-title":"Acta Informatica"},{"key":"45_CR13","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"160","DOI":"10.1007\/3-540-16442-1_12","volume-title":"The Choice of programming primitives for SETL-like programming languages","author":"E. Dahlhaus","year":"1986","unstructured":"E. Dahlhaus, J. Makowsky. The Choice of programming primitives for SETL-like programming languages. LNCS, v. 210 (1986) 160\u2013172"},{"key":"45_CR14","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/0743-1066(92)90020-4","volume":"13","author":"J.V. Tucker","year":"1992","unstructured":"J.V. Tucker, J.I. Zucker. Deterministic and nondeterministic computation, and Horn programs, on abstract data types. J. Logic Programming, v. 13 (1992) 23\u201355","journal-title":"J. Logic Programming"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/0304-3975(93)90345-T","volume":"119","author":"V. Yu. Sazonov","year":"1993","unstructured":"V. Yu. Sazonov. Hereditarily-finite sets, data bases and polynomial computability. Theoretical Computer Science, v. 119 (1993) 187\u2013214","journal-title":"Theoretical Computer Science"},{"key":"45_CR16","first-page":"38","volume":"6","author":"N.S. Nikitchenko","year":"1995","unstructured":"N.S. Nikitchenko. Construction of composition systems on a base of identified data. Kibernetika i systemny analiz, No 6 (1995) 38\u201344. In Russian.","journal-title":"Kibernetika i systemny analiz"},{"key":"45_CR17","doi-asserted-by":"publisher","first-page":"613","DOI":"10.1145\/359576.359579","volume":"21","author":"J. Backus","year":"1978","unstructured":"J. Backus. Can programming be liberated from the von Neumann style? A functional style and its algebra of programs. Communs. ACM, v. 21 (1978) 613\u2013641","journal-title":"Communs. ACM"},{"key":"45_CR18","unstructured":"I.A. Basarab, B.V. Gubsky, N.S. Nikitchenko, V.N. Red\u2019ko. Composition models of databases. Extending Inf. Syst. Technology, II Int. East-West Database Workshop, Sept. 25-28, 1994, Klagenfurt, Austria (1994) 155\u2013163"}],"container-title":["Lecture Notes in Computer Science","Perspectives of System Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45575-2_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T09:35:05Z","timestamp":1556444105000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45575-2_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540430759","9783540455752"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-45575-2_45","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}