Skip to main content
SpringerLink
Log in

Programming means and the solution of logical problems in software systems (basic concepts of the L2 language)

  • 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

Literature Cited

  1. V. M. Glushkov, N. M. Grishchenko, Yu. V. Kapitonova, and A. A. Letichevskii, “Automatic programming in the PROEKT system,” Kibernetika, No. 4 (1970).

  2. V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Software of the automated system for designing computers and computing systems (PROEKT),” Kibernetika, No. 4 (1970).

  3. S. S. Gorokhovskii, Yu. V. Kapitonova, A. A. Letichevskii, A. I. Khlebnikov, and V. P. Shevchenko,” Extension of the DEREVO (TREE) language of the PROEKT programming system,” Kibernetika, No. 4 (1972).

  4. Yu. V. Kapitonova et al., “Extensions of the SISTEMA(SYSTEM) programming language for the PROEKT system,” Kibernetika, No. 3 (1972).

  5. V. G. Bondarchuk, V. M. Glushkov, et al, “The ANALITIK language,” in: Automata Theory [in Russian], Vol. 1, Kiev (1968).

  6. A. A. Letichevskii, “Syntax and semantics of formal languages,” Kibernetika, No. 4 (1968).

  7. V. A. Vasil'ev, “On constructing sets of forms of quantities in algorithmic languages,” Zh. Vychisl. Matem. i Matem. Fiz.10, No. 5 (1970).

  8. M. E. D'Imperio, “Data structures and their representation in storage,” in Annual Review in Automatic Programming, Vol. 5, Pergamon Press, New York (1969).

    Google Scholar 

  9. J. Earley, “Toward an understanding of data structures,” Commun. ACM,14, No. 10 (1971).

  10. A. C. Fleck, “Toward a theory of data structures,” J. Computer and Systems Sci.,5, No. 5 (1971).

  11. A. L. Rosenberg, “Data graphs and addressable schemes,” J. Computer and Systems Sci.,5, No. 3 (1971).

  12. A. L. Rosenberg, “Addressable data graphs,” J. ACM,19, No. 2 (1972).

  13. W. M. Turski, “A model for data structures and its applications. 1,” Acta Informatica,1, No. 1 (1972).

  14. T. W. Pratt and D. P. Friedman, “A language extension for graph processing and its formal semantics,” Commun. ACM,14, No. 7 (1971).

Download references

Authors
  1. S. S. Gorokhovskii
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yu. V. Kapitonova
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. A. A. Letichevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika, No. 4, pp. 27–47, July–August, 1973.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Gorokhovskii, S.S., Kapitonova, Y.V. & Letichevskii, A.A. Programming means and the solution of logical problems in software systems (basic concepts of the L2 language). Cybern Syst Anal 9, 577–597 (1973). https://doi.org/10.1007/BF01068582

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation