Abstract
An explication of the intuitive concept of programming is given in the form of explicative programming, which is a modern form of composition programming. It is based on a pragmatically finite system of principles. On this basis, an explication of the concept of composition is obtained. A hierarchical composition structure of programmology is constructed.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
V. N. Red’ko, “Explicative programming: Past and future,” in: Ist Intern. Scient.-Pract. Conf. UkrPROG’98, Akad. Nauk Ukrainy, Kyiv (1998), pp. 3–24.
V. N. Red’ko, “Composition structure of programmology,” Kibern. Sist. Anal., No. 4, 47–66 (1998).
V. N. Red’ko, “Programmology: Past, present, and future,” Vestn. Mezhd. Solomon. Univ., No. 1, 23–59 (1999).
R. Carnap, Meaning and Necessity [Russian translation], IL, Moscow, 1958.
V. Dal’, Explanatory Dictionary [in Russian], Vols. 1 and 2, Terra, Moscow (1995).
J. Backus, “Can programming be liberated from the Neumann style? A functional style and its algebra of programs,” Comm. ACM, 21(8), 613–641 (1978).
G. Frege, “Uber Sinn und Bedeutung,” Zeitschrift fur Philosophie und Philosophische Kritik, Bd. 100, 25–50 (1982).
A. Church, Introduction to Mathematical Logic [Russian translation], Vol. 1, IL, Moscow (1960).
D. Gris, The Science of Programming [Russian translation], Mir, Moscow (1984).
E. Dijkstra, A Discipline of Programming [Russian translation], Mir, Moscow (1978).
Yu. L. Yershov, Definability and Computability [in Russian], Nauchn. Kniga, Novosibirsk (1996).
A. Poincaré, About Science [Russian translation], Fizmatgiz, Moscow (1983).
B Rassel, “La theorie des types logiques,” Rev. Metaph. Mor., 18, 263–301 (1910).
S. Kleene, Introduction to Metamathematics [Russian translation], IL, Moscow (1957).
A. Tarski, “A lattice-theoretical fixpoint theorem and its applications,” Pacific J. Math.,5, No. 2, 285–309 (1955).
V. N. Red’ko, “Some problems of the theory of languages,” Kibernetika, No. 4, 12–21 (1965).
D. B. Bui and V. N. Red’ko, “Programmological aspects of the fixed point method,” Kibem. Sist. Anal., No. 5, 158–167 (1994).
D. B. Bui and V. N. Red’ko, “Fixed points and closure operators: Programmological aspects,” Kibern. Sist. Anal., No. 1, 113–121 (1995).
U. Dahl, C. Hoare, and E. Dijkstra, Structured Programming [Russian translation], Mir, Moscow (1975).
H. Barendregt, The Lambda-calculus [Russian translation], Mir, Moscow (1985).
V. N. Red’ko, “Program compositions and composition programming,” Programmirovanie, No. 5, 3–24 (1978).
V. N. Red’ko, “Foundations of composition programming,” Programmirovanie, No. 3, 3–13 (1979).
V. M. Glushkov, “Automata theory and formal transformations of microprograms,” Kibernetika, No. 5, 3–10 (1965).
Author information
Authors and Affiliations
Additional information
Translated from Kibemetika i Sistemnyi Analiz, No. 1, pp. 35–57, January–February, 2000.
Rights and permissions
About this article
Cite this article
Red’ko, V.N. Foundations of programmology. Cybern Syst Anal 36, 27–42 (2000). https://doi.org/10.1007/BF02733300
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02733300