Advertisement

Springer Nature is making Coronavirus research free. View research | View latest news | Sign up for updates

Composition aspects of programmology. I

  • 16 Accesses

This is a preview of subscription content, log in to check access.

Literature Cited

  1. 1.

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

  2. 2.

    V. N. Red'ko, “Fundamentals of composition programming,” Programmirovanie, No. 3, 3–13 (1979).

  3. 3.

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

  4. 4.

    V. N. Red'ko, “Universal program logics and their application,” in: System and Theoretical Programming, Abstracts of papers at 4th All-Union Symp. [in Russian], Shtiintsa, Kishinev (1983), pp. 310–326.

  5. 5.

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

  6. 6.

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

  7. 7.

    N. S. Nikitchenko and S. S. Shkil'nyak, “Program definers,” Programmirovanie, No. 1, 3–10 (1983).

  8. 8.

    A. V. Nazarenko, Methods of Integrated Description of Programming Languages in Language Processor Construction Systems [in Russian], Abstract of thesis, Kiev (1986).

  9. 9.

    M. G. Gontsa, Multilanguage Compiling Systems. Syntax. Semantics. Design [in Russian], Shtiintsa, Kishenev (1978).

  10. 10.

    V. N. Volokhov, S. V. Voronov, A. P. Gorbachik, and others, “DEFIPS 3-an automated system for the construction of language processors,” Upr. Sist. Mash., No. 3, 69–73 (1984).

  11. 11.

    I. A. Basarab, M. S. Lisovskii, and B. V. Gubskii, “An interactive information system for processing of table data structures,” Mekh. Avtomat. Upr., No. 2, 33–36 (1986).

  12. 12.

    V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5, 1–9 (1965).

  13. 13.

    J. Backus, “Can programming be liberated from the von Neumann style? A functional style and its algebra of programs,” Comm. ACM,21, No. 8, 613–641 (1978).

  14. 14.

    D. Bjorner and C. B. Jones (eds.), The Vienna Development Method; The Meta-Language, Lecture Notes Computer Sci., Vol. 61, Springer, Berlin (1978).

  15. 15.

    A. Allangren, Definition of Programming Languages by Interpreting Automata [Russian translation], Mir, Moscow (1977).

  16. 16.

    V. A. Val'kovskii, V. E. Kotov, A. G. Marchuk, et al., Elements of Parallel Programming [in Russian], Radio i Svyaz', Moscow (1983).

  17. 17.

    M. I. Beletskii, “On mathematical modeling of data transformation, I. Relational systems of general type,” Semiot. Inform., No. 16, 44–77 (1981).

  18. 18.

    P. M. Cohn, Universal Algebra [Russian translation], Mir, Moscow (1968).

  19. 19.

    N. S. Nikitchenko, Semantic-Syntactic Structures of Programs [in Russian], Abstract of thesis, Kiev (1980).

  20. 20.

    N. S. Nikitchenko, “Composition semantics of programming languages,” Programmirovanie, No. 6, 9–18 (1982).

  21. 21.

    I. A. Basarab and B. N. Red'ko, “Data bases from logical-functional point of view,” Programmirovanie, No. 2, 53–67 (1984).

  22. 22.

    A. V. Mavlyanov, Analysis and Development of Special-Purpose Language Processors with Semantic-Syntactic Control [in Russian], Abstract of thesis, Kiev (1986).

  23. 23.

    S. V. Voronov, The Design of Language Processors with Semantic-Syntactic Control [in Russian], Abstract of thesis, Kiev (1987).

  24. 24.

    A. T. Samoilenko, “Generation of a language processor for the SNOBOL-4 programming language,” Model. Sist. Obrab. Inform., No. 4, 95–97 (1985).

  25. 25.

    N. S. Nikitchenko, “Compositions of programs inducing monotone functions of special kind,” Programmirovanie, No. 1, 3–17 (1987).

  26. 26.

    N. S. Nikitchenko and V. N. Red'ko, “Composition and functional programming: a comparative analysis,” Programmirovanie, No. 2, 15–28 (1985).

  27. 27.

    V. E. Kotov, An Introduction to the Theory of Program Schemata [in Russian], Nauka, Novosibirsk (1978).

  28. 28.

    A. P. Ershov, “Computability in arbitrary domains and bases,” Semiot. Inform., No. 19, 3–58 (1982).

  29. 29.

    V. A. Uspenskii and A. L. Semenov, “Theory of algorithms: its basic discoveries and applications,” in: Algorithms in Modern Mathematics and Its Applications [in Russian], part 1, VTs SO AN SSSR, Novosibirsk (1982), pp. 99–342.

  30. 30.

    Yu. L. Ershov, “Computable functionals of finite types,” Algebra i Logika,11, No. 4, 367–437 (1972).

  31. 31.

    J. K. Barwise, Admissible Sets and Structures, Springer, Berlin (1975).

  32. 32.

    J. V. Tucker, “Computing in algebraic systems,” in: Recursion Theory: Its Generalizations and Applications, Proc. Logic Coll. 79, Cambridge Univ. Press, Cambridge (1980), pp. 215–235.

  33. 33.

    R. Gandy, “Church's thesis and principles for mechanisms,” in: The Kleene Symposium, J. Barwise et al. (eds.), North-Holland, Amsterdam (1980), pp. 123–148.

  34. 34.

    A. K. Chandra and D. Harel, “Computable queries for relational data bases,” J. Comput. Syst. Sci.,22, No. 2, 156–178 (1980).

  35. 35.

    D. Scott, “Domains for denotational semantics,” Lect. Notes Computer Sci.,140, 577–613 (1982).

  36. 36.

    Y. N. Moschovakis, “Abstract recursion as a foundation for the theory of algorithms,” Lect. Notes Math.,1104, 289–362 (1984).

  37. 37.

    A. F. Kfoury and P. Urzyczyn, “Necessary and sufficient conditions for the universality of programming formalisms,” Acta Inform.,22, 347–377 (1985).

  38. 38.

    E. Dahlhaus and J. A. Makowsky, “The choice of programming primitives for SETL-Like programming languages,” Lect. Notes Computer Sci.,210, 160–172 (1986).

  39. 39.

    S. S. Goncharov and D. I. Sviridenko, “Σ-programming,” Vychisl. Sist., No. 107, 3–29 (1985).

  40. 40.

    N. S. Nikitchenko, “Computable compositions and universal imperative program logics,” Programmirovanie, No. 6, 3–14 (1983).

  41. 41.

    N. S. Nikitchenko, “On the construction of classes of generalized computable functions and functionals,” Manuscript Deposited at UkrNIINTI, 15.05.84, No. 856 Uk-84, Kiev (1984).

  42. 42.

    V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Theoretical principles of discrete system design,” Kibernetika, No. 6, 5–20 (1977).

Download references

Additional information

Translated from Kibernetika, No. 5, pp. 49–56, September–October, 1987.

Rights and permissions

Reprints and Permissions

About this article

Cite this article

Red'ko, V.N., Nikitchenko, N.S. Composition aspects of programmology. I. Cybern Syst Anal 23, 627–637 (1987). https://doi.org/10.1007/BF01074922

Download citation

Keywords

  • Operating System
  • Artificial Intelligence
  • System Theory
  • Composition Aspect