Composition-nominative aspects of address programming

  • M. S. Nikitchenko

Basic principles of address programming, namely, addressness and program control are considered and analyzed. Their further development within the framework of composition and compositionnominative programming is demonstrated.


programming theory address programming composition programming compositionnominative programming principle of addressness principle of program control program semantics composition data structure nominative data 


  1. 1.
    B. V. Gnedenko, V. S. Korolyuk, and E. L. Yushchenko, Elements of Programming [in Russian], Fizmatgiz, Moscow (1961).Google Scholar
  2. 2.
    V. S. Korolyuk, “A programming method,” Dop. AN URSR, No. 12, 1292–1295 (1958).Google Scholar
  3. 3.
    V. S. Korolyuk and E. L. Yushchenko, Questions of the Theory and Practice of Programming [in Russian], Sb. VTs AN URSR, 1 (1960).Google Scholar
  4. 4.
    E. L. Yushchenko, Address Algorithms and Digital Automatic Machines [in Ukrainian], Sb. VTs AN URSR, 2 (1960).Google Scholar
  5. 5.
    E. L. Yushchenko and L. P. Bystrova, Programming Program That Processes an Address Algorithm [in Ukrainian], Sb. VTs AN URSR, 3 (1960).Google Scholar
  6. 6.
    V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Cybernetics, No. 5, 3–10 (1965).Google Scholar
  7. 7.
    V. N. Red’ko, “Compositions of programs and composition programming,” Programmirovanie, No. 5, 3–24 (1978).Google Scholar
  8. 8.
    V. N. Red’ko, “Foundations of composition programming,” Programmirovanie, No. 3, 3–13 (1979).Google Scholar
  9. 9.
    V. N. Red’ko, “Semantic structures of programs,” Programmirovanie, No. 1, 3–14 (1981).Google Scholar
  10. 10.
    I. A. Basarab, N. S. Nikitchenko, and V. N. Red’ko, Composition Databases [in Russian], Lybid’, Kiev (1992).Google Scholar
  11. 11.
    V. N. Red’ko and G. G. Trubchaninov, “Syntactic definitions (structural approach),” Programmirovanie, No. 5, 9–20 (1977).Google Scholar
  12. 12.
    V. N. Red’ko and S. S. Shkil’nyak, “Structures of syntactic definitions of programming languages,” Programmirovanie, No. 4, 3–15 (1979).Google Scholar
  13. 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).Google Scholar
  14. 14.
    N. A. Nikitchenko, “Composition-Nominative Approach to Program Semantics,” Techn. Rep. IT–TR: 1998–020, Technical University of Denmark (1998).Google Scholar
  15. 15.
    N. S. Nikitchenko, “Composition-nominative approach to the refinement of the concept of a program,” Probl. Progr., No. 1, 16–31 (1999).Google Scholar
  16. 16.
    N. S. Nikitchenko, “Intensional aspects of the concept of a program,” Probl. Progr., Nos. 3– 4, 5–13 (2001).Google Scholar
  17. 17.
    M. S. Nikitchenko and S. S. Shkil’nyak, Mathematical Logic and Algorithm Theory [in Ukrainian], VPTs “Kyivs’kyi Universitet,” Kyiv (2008).Google Scholar
  18. 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).CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, Inc. 2009

Authors and Affiliations

  1. 1.Taras Shevchenko National UniversityKievUkraine

Personalised recommendations