Abstract
Partial multi-valued functions represent semantics of nondeterministic programs. The notion of naturally computable partial multi-valued function is introduced and algebraic representations of complete classes of naturally computable functions over various data structures are constructed.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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–420
A.P. Ershov. Computability in arbitrary domains and bases. Semiotics and Informatics, No. 19 (1982) 3–58. In Russian.
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.
I.A. Basarab, N.S. Nikitchenko, V.N. Red’ko. Composition databases, Kiev, Lybid’ (1992) 192 p. In Russian.
N. Nikitchenko. A composition nominative approach to program semantics. Technical Report IT-TR: 1998-020. Technical University of Denmark (1998) 103 p.
V.N. Red’ko. Composition of programs and composition programming. Programmirovanie, No 5 (1978) 3–24. In Russian.
K. Grue. Map theory. Theoretical Computer Science, v. 102(1) (1992) 1–133
M. Atkinson, et. al. The object-oriented database system manifesto. DOOD’89 (1989) 40–57
R. Gandy. Church’s thesis and principles for mechanisms. The Kleene Symp. Eds. J. Barwise, et. al, Amsterdam: North-Holland (1980) 123–148
D. Scott. Domains for denotational semantics. LNCS, v. 140 (1982) 577–613
Y.N. Moschovakis. Abstract recursion as a foundation for the theory of algorithms. Lect. Notes Math, v. 1104 (1984) 289–362
A.J. Kfoury, P. Urzyczyn. Necessary and sufficient conditions for the universality of programming formalism. Acta Informatica, v. 22 (1985) 347–377
E. Dahlhaus, J. Makowsky. The Choice of programming primitives for SETL-like programming languages. LNCS, v. 210 (1986) 160–172
J.V. Tucker, J.I. Zucker. Deterministic and nondeterministic computation, and Horn programs, on abstract data types. J. Logic Programming, v. 13 (1992) 23–55
V. Yu. Sazonov. Hereditarily-finite sets, data bases and polynomial computability. Theoretical Computer Science, v. 119 (1993) 187–214
N.S. Nikitchenko. Construction of composition systems on a base of identified data. Kibernetika i systemny analiz, No 6 (1995) 38–44. In Russian.
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–641
I.A. Basarab, B.V. Gubsky, N.S. Nikitchenko, V.N. Red’ko. Composition models of databases. Extending Inf. Syst. Technology, II Int. East-West Database Workshop, Sept. 25-28, 1994, Klagenfurt, Austria (1994) 155–163
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nikitchenko, N.S. (2001). Abstract Computability of Non-deterministic Programs over Various Data Structures. In: Bjørner, D., Broy, M., Zamulin, A.V. (eds) Perspectives of System Informatics. PSI 2001. Lecture Notes in Computer Science, vol 2244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45575-2_45
Download citation
DOI: https://doi.org/10.1007/3-540-45575-2_45
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43075-9
Online ISBN: 978-3-540-45575-2
eBook Packages: Springer Book Archive