Skip to main content
SpringerLink
Log in

Formalization of the concept of program

  • Published:
Cybernetics Aims and scope

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. N. I. Glebov, “Synthesis of operators,” collection: Problems of Cybernetics [in Russian], 8, Fizmatgiz, Moscow, 1962.

    Google Scholar 

  2. N. I. Glebov, “On the algebraic equivalence of subsets of categories,” collection: Problems of Cybernetics [in Russian], 8, Fizmatgiz, Moscow, 1962.

    Google Scholar 

  3. N. I. Glebov, “The construction of a class of R-criteria of equivalence,” collection: Problems of Cybernetics [in Russian], 9, Fizmatgiz, Moscow 1963.

    Google Scholar 

  4. V. M. Glushkov, “Theory of automata and the formal transformation of programs,” Kibernetika [Cybernetics], no. 5, Kiev, 1965.

  5. A. P. Ershov, “Operational algorithms. I,” collection: Problems of Cybernetics [in Russian], 3, Fizmatgiz, Moscow, 1960.

    Google Scholar 

  6. A. P. Ershov, “Programming arithmetical operators,” DAN SSSR, 118, no. 3, 1961.

  7. A. P. Ershov, “Operational algorithms, II,” collection: Problems of Cybernetics [in Russian], 8, Fizmatgiz, Moscow, 1962.

    Google Scholar 

  8. A. P. Ershov, “Reduction of the problem of memory economy in program compilation to the problem of coloring the vertices of graphs, DAN SSSR, 142, no. 4, 1962.

  9. A. P. Ershov, L. L. Zmievskaya, P. D. Mishkovich, and L. K. Trokhan, “The economy and distribution of the memory in the AL'FA-converter,” collection: The AL'FA-system of Automation of Programming [in Russian], Novosibirsk, SO AN SSSR, 1965.

    Google Scholar 

  10. A. P. Ershov, “Operator diagrams over general and distributed memory,” Kibernetika [Cybernetics], Kiev, 1968 (in press).

  11. A. P. Ershov, “The operator diagrams of Yanov,” collection: Problems of Cybernetics [in Russian], 20, izd-vo Nauka, Moscow, 1967.

    Google Scholar 

  12. L. A. Kaluznin, “The algorithmization of mathematical problems,” collection: Problems of Cybernetics [in Russian], 2, Fizmatgiz, Moscow, 1959.

    Google Scholar 

  13. V. S. Korolyuk, “The concept of address algorithm,” collection: Problems of Cybernetics [in Russian], 4, Fizmatgiz, Moscow, 1960.

    Google Scholar 

  14. V. E. Kotov, “Some problems of the translation of operator diagrams into asynchronous programs,” collection: Proceedings of III All-Union Conference on Information Retrieval Systems and the Automation of the Processing of Scientific-Technical Information [in Russian], VINITI, Moscow, 1967.

    Google Scholar 

  15. V. E. Kotov and A. S. Narin'yani, “Asynchronous computational processes over the memory,” Kibernetika [Cybernetics], no. 3, Kiev, 1966.

  16. V. E. Kotov and A. S. Narin'yani, “Transformation of operator diagrams into asynchronous programs,” collection: Computational Systems [in Russian] (Proceedings of a symposium, Novosibirsk, May, 1966), Izd-vo Nauka, Novosibirsk, 1967.

    Google Scholar 

  17. N. A. Krinitskii, Equivalent Transformations of Logical Schemes [in Russian], Author's abstract of dissertation, MGU, Moscow, 1959.

    Google Scholar 

  18. N. A. Krinitskii, G. A. Mironov, and G. D. Frolov, Programming [in Russian], izd-vo Nauka, Moscow, 1966.

    Google Scholar 

  19. S. S. Lavrov, “Economy of the memory in closed operator diagrams,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, 1 no. 4, Moscow, 1966.

  20. A. A. Lyapunov, “Logical schemes of programs,” collection: Problems of Cybernetics [in Russian], 1, Fizmatgiz, Moscow, 1958.

    Google Scholar 

  21. A. A. Lyapunov, “Toward an algebraic treatment of programming,” collection: Problems of Cybernetics [in Russian], 8, Fizmatgiz, Moscow, 1962.

    Google Scholar 

  22. V. V. Martynyuk, “The economic allocation of memory,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, 2, no. 3, Moscow, 1962.

  23. V. V. Martynyuk, “Economic construction of the transtive closure of the binary relation,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, 2, no. 4, Moscow, 1962.

  24. V. V. Martynyuk, “The analysis of the transition graph for an operator diagram,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki, 5, no. 2, Moscow, 1965.

  25. V. V. Martynyuk, “On the testing of the equivalence of operator diagrams,” collection: Abstracts of Brief Scientific Communications of the International Congress of Mathematicians 1966 (section 14) [in Russian], Moscow, 1966.

  26. A. S. Narin'yani, “Some questions of asynchronous programming,” collection: Proceedings of III All-Union Conference on Information Retrieval Systems and the Automation of the Processing of Scientific-Technical Information [in Russian], VINITI, Moscow, 1967.

    Google Scholar 

  27. A. S. Nikitin, “Algorithm of economic utilization of the memory,” Kibernetika [Cybernetics], no. 6, Kiev, 1965.

  28. A. S. Nikitin, “A class of equivalent transformations of operator diagrams,” Kibernetika [Cybernetics], no. 5, Kiev, 1966.

  29. R. I. Podlovchenko, “The fundamental concepts of programming,” collection: Problems of Cybernetics [in Russian], 1, Moscow, 1958.

  30. R. I. Podlovchenko, “The fundamental concepts of programming, II” collection: Problems of Cybernetics, 3 [in Russian], Fizmatgiz, Moscow, 1960.

    Google Scholar 

  31. R. I. Podlovchenko, “On the transformation of program diagrams and their application in programming,” collection: Problems of Cybernetics, 7 [in Russian], Fizmatgiz, Moscow, 1962.

    Google Scholar 

  32. R. I. Podlovchenko, “Example of the use of transformations of the logical diagrams of programs,” collection: Problems of Cybernetics, 11 [in Russian], Fizmatgiz, Moscow, 1963.

    Google Scholar 

  33. I. V. Pottosin, “The problem of cycle cleanout, collection: Digital Computational Techniques and Programming, no. 3 [in Russian], izd-vo Sovetskoe radio, Moscow, 1967.

    Google Scholar 

  34. Yu. I. Smirnov, “The transformation of operator diagrams,” Zhurnal vychislitel'noi matematiki i matematicheskoi fiziki 3, no. 3, Moscow, 1963.

  35. Yu. I. Smirnov, “The construction of the matrix of prohibitions for an operator diagram with address to a library,” Vychislitel'noi matematiki i matematicheskoi fiziki, 4, no. 1, Moscow, 1964.

  36. R. N. Tonoyan, “Logical schemes of algorithms and their equivalent transformations,” collection: Problems of Cybernetics [in Russian], 14, izd-vo Nauka, Moscow, 1964.

    Google Scholar 

  37. Yu. A. Shreider, “On the concepts of generalized programming,” collection: Questions of the Theory of Mathematical Machines, no. 2 [in Russian], Fizmatgiz, Moscow, 1962.

    Google Scholar 

  38. V. S. Shtarkman, “The block economy of working cells in PP,” collection: Problems of Cybernetics, 1 [in Russian], Fizmatgiz, Moscow, 1958.

    Google Scholar 

  39. E. L. Yushchenko, Address Programming [in Russian], GITL, UkrSSR, 1963.

    Google Scholar 

  40. Yu. I. Yanov, “Logical diagrams of algorithms,” collection: Problems of Cybernetics 1 [in Russian], Fizmatgiz, Moscow, 1958.

    Google Scholar 

  41. Yu. I. Yanov, “Logical transformations of diagrams of algorithms,” collection: Problems of Cybernetics, 20 [in Russian], izd-vo Nauka, Moscow, 1967.

    Google Scholar 

  42. H. Hermes, Die Universalität der programmgesteuerte Rechenmaschine, Math. Phys. Semsterberichte, Göttingen, 4, pp. 42–53, 1954.

    Google Scholar 

  43. H. Kaphengst, Eine Abstrakte programmgesteuerte Rechenmaschine, Zeit Math. Logik and Grnd. d. Math, 5, pp. 366–379, 1959.

    Google Scholar 

  44. A. Kurtukov, On the Optimal Arrangement of Graphs, ICC Bulletin, 6, 1967.

  45. T. Marill, Computational Chains and the Simplification of Computer Programs, IRE Trans. Electr. Comput, 11, pp. 173–180, 1962.

    Google Scholar 

  46. J. McCarthy, Towards a Mathematical Science of Computation, Proceedings of the IFIP Congress, Munich, 1962, Amsterdam, North-Holland, pp. 21–28, 1963.

    Google Scholar 

  47. R. Peter, Graphschemata und rekursive Funktionen, Dialectica,12, pp. 373–388, 1958.

    Google Scholar 

  48. H. G. Rice, Classes of Recursively Enumerable Sets and Their Decision Problems, Trans. Amer. Math. Soc.,74, no. 2, pp. 358–366, 1953.

    Google Scholar 

  49. J. Riguet, Programmation et Theories des Categories, in: Symbol. Languages Data, New York, London, Gordon and Breach, pp. 83–98, 1962.

    Google Scholar 

  50. J. C. Sheperdson and H. E. Sturgis, Computability of Recursive Functions, Journal of the ACM, 10, no. 2, pp. 217–255, 1963.

    Google Scholar 

  51. W. L. van der Poel, The Essential Types of Operations in an Automatic Computer, Nachrichtentechnische Fachberichte, 4, 1956.

  52. A. van Wijagaarden, A Draft Proposal for the Algorithmic Language ALGOL-67, MR-88, Amsterdam, Mathematische Zentrum, May 1967.

Download references

Author information

Authors and Affiliations

  1. Siberian Division AS USSR, Novosibirsk

    A. P. Ershov & A. A. Lyapunov

Authors
  1. A. P. Ershov
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Lyapunov
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Kibernetika, Vol. 3, No. 5, pp. 40–57, 1967

Rights and permissions

Reprints and permissions

About this article

Cite this article

Ershov, A.P., Lyapunov, A.A. Formalization of the concept of program. Cybern Syst Anal 3, 35–49 (1967). https://doi.org/10.1007/BF01071595

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01071595

Keywords

Search

Navigation