Composition-nominative aspects of address programming

1. B. V. Gnedenko, V. S. Korolyuk, and E. L. Yushchenko, Elements of Programming [in Russian], Fizmatgiz, Moscow (1961).

   Google Scholar 

2. V. S. Korolyuk, “A programming method,” Dop. AN URSR, No. 12, 1292–1295 (1958).

3. V. S. Korolyuk and E. L. Yushchenko, Questions of the Theory and Practice of Programming [in Russian], Sb. VTs AN URSR, 1 (1960).

4. E. L. Yushchenko, Address Algorithms and Digital Automatic Machines [in Ukrainian], Sb. VTs AN URSR, 2 (1960).

5. E. L. Yushchenko and L. P. Bystrova, Programming Program That Processes an Address Algorithm [in Ukrainian], Sb. VTs AN URSR, 3 (1960).

6. V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Cybernetics, No. 5, 3–10 (1965).

7. V. N. Red’ko, “Compositions of programs and composition programming,” Programmirovanie, No. 5, 3–24 (1978).

8. V. N. Red’ko, “Foundations of composition programming,” Programmirovanie, No. 3, 3–13 (1979).

9. V. N. Red’ko, “Semantic structures of programs,” Programmirovanie, No. 1, 3–14 (1981).

10. I. A. Basarab, N. S. Nikitchenko, and V. N. Red’ko, Composition Databases [in Russian], Lybid’, Kiev (1992).

    Google Scholar 

11. V. N. Red’ko and G. G. Trubchaninov, “Syntactic definitions (structural approach),” Programmirovanie, No. 5, 9–20 (1977).

12. V. N. Red’ko and S. S. Shkil’nyak, “Structures of syntactic definitions of programming languages,” Programmirovanie, No. 4, 3–15 (1979).

13. V. N. Red’ko, Yu. I. Brona, D. B. Bui, and S. A. Polyakov, Relational Databases: Tabular Algebras and SQL-Like Languages [in Ukrainian], Vydavn. Dim “Akademperiodika,” Kyiv (2001).

14. N. A. Nikitchenko, “Composition-Nominative Approach to Program Semantics,” Techn. Rep. IT–TR: 1998–020, Technical University of Denmark (1998).

15. N. S. Nikitchenko, “Composition-nominative approach to the refinement of the concept of a program,” Probl. Progr., No. 1, 16–31 (1999).

16. N. S. Nikitchenko, “Intensional aspects of the concept of a program,” Probl. Progr., Nos. 3– 4, 5–13 (2001).

17. M. S. Nikitchenko and S. S. Shkil’nyak, Mathematical Logic and Algorithm Theory [in Ukrainian], VPTs “Kyivs’kyi Universitet,” Kyiv (2008).

18. N. S. Nikitchenko, “Abstract computability of non-deterministic programs over various data structures,” Perspectives of System Informatics (Proc. of Andrei Ershov Fourth Int. Conf.), Novosibirsk, Russia (July 2–6) (2001); Revised Papers. Lecture Notes in Comput. Sci., 2244, 468–481 (2001).

    Article  MathSciNet  Google Scholar 

Download references