Skip to main content
SpringerLink
Log in

Basic paradigms of programming

  • Cybernetics
  • Published:
Cybernetics and Systems Analysis 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. R. W. Floyd, “The paradigms of programming,” ACM Turing Award Lectures: The First Twenty Years 1966–1985, Anthology Series, ACM Press, New York (1987), pp. 131–143.

    Google Scholar 

  2. E. Dijkstra, “Comments on structured programming,” in W. Dahl, E. Dijkstra, and C. Hoare, Structured Programming [Russian translation], Mir, Moscow (1975), pp. 7–97.

    Google Scholar 

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

    Google Scholar 

  4. Yu. V. Kapitonova and A. A. Letichevskii, Mathematical Theory of Computer System Design [in Russian], Nauka, Moscow (1988).

    Google Scholar 

  5. C. Hoare, Cooperating Sequential Processes [Russian translation], Mir, Moscow (1989).

    Google Scholar 

  6. J. Rees and W. Clinger, “Revised report on the algorithmic language Schema,” Sigplan Notices,21, No. 12, 37–79 (1986).

    Google Scholar 

  7. R. Milner, The Standard ML Core Language, Dept. Comp. Sci., Univ. Edinburgh (1984).

  8. G. Huet and D. Oppen, “Equations and rewrite rules. A survey,” in. Formal Languages: Perspectives and Open Problems, Pergamon Press, New York (1980), pp. 349–405.

    Google Scholar 

  9. N. Dershovitz and J.-P. Jouannaud, “Rewrite systems,” in: J. van Leeuwen, ed., Handbook of Theoretical Computer Science (1990).

  10. O'Donnell, “Term rewriting implementation of equational logic programming,” in: Rewriting Techniques and Applications, P. Lescanne (ed.) (1987), pp. 1–12.

  11. V. M. Glushkov, et al., “ANALITIK (an algorithmic language for description of computational processes using analytical transformations),” Kibernetika, No. 3, 102–134 (1971).

    MATH  Google Scholar 

  12. V. N. Agafonov (ed.), Logic Programming [Russian translations], Mir, Moscow (1988).

    Google Scholar 

  13. Yu. V. Kapitonova and A. A. Letichevskii, “Methods and tools of algebraic programming” Kibernetika, No. 3, 7–12 (1993).

    Google Scholar 

  14. A. A. Letichevsky, J. V. Kapitonova, and S. V. Konozenko, “Computations in APS,” Theoret. Comput. Sci.,119, 145–171 (1993).

    Article  MathSciNet  Google Scholar 

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

    Google Scholar 

  16. M. Fitting, “A Kripke-Kleene semantics for logic programs,” J. Logic Programm., No. 4, 195–312 (1985).

    Google Scholar 

  17. Yu. V. Kapitonova and A. A. Letichevskii, “Constructive mathematical description of application domains,” Kibernetika, No. 4, 17–25 (1988).

    MathSciNet  Google Scholar 

Download references

Authors
  1. V. Yu. Kapitonova
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. A. A. Letichevskii
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 3–20, November–December, 1994.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Yu. Kapitonova, V., Letichevskii, A.A. Basic paradigms of programming. Cybern Syst Anal 30, 793–806 (1994). https://doi.org/10.1007/BF02366437

Download citation

  • Received:

  • Issue Date:

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

Keywords

Search

Navigation