Abstract
Program models allowing for polymorphism are proposed. The emphasis is on the functional-semantic aspect of polymorhpism. The relationship of the polymorphic models with other more abstract program models is examined.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Literature Cited
N. Wirth, “Program development by stepwise refinement”, Comm. ACM,14, No. 4, 221–227 (1971).
D. Bjorner and C. B. Jones, The Vienna Development Method: The Metalanguage, Lect. Notes Comput. Sci.,61, Springer, Berlin (1978).
F. L. Bauer, “Program development by stepwise transformations: the project CIP”, Lect. Notes Comput. Sci.,69, 237–266 (1979).
V. M. Glushkov, Yu. V. Kapitonova, and A. A. Letichevskii, “Application of the method of formalized technical specifications to the design of programs processing data structures”, Programmirovanie, No. 6, 31–43 (1978).
V. M. Glushkov, G. E. Tseitlin, and E. L. Yushchenko, “Multilevel structured program design: formalization of the method and sphere of applications”, Kibernetika, No. 4, 42–65 (1981).
V. M. Glushkov, “Automata theory and formal representation of microprograms”, Kibernetika, No. 5, 1–9 (1965).
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).
V. N. Red'ko, “Compositions of programs and composition programming”, Programmirovanie, No. 5, 3–24 (1978).
V. N. Red'ko, “Foundations of composition programming”, Programmirovanie, No. 3, 3–13 (1979).
V. N. Red'ko and N. S. Nikitchenko, “Composition aspects of programmology. I, II”, Kibernetika, No. 5, 49–56 (1987); No. 1, 28–34 (1988).
N. S. Nikitchenko, “Semantic program design by compatible compositions”, Programmirovanie, No. 6, 14–27 (1987).
N. S. Nikitchenko, “Program compositions inducing monotone functions of a special kind”, Programmirovanie, No. 1, 3–17 (1987).
R. Milner, “A theory of type polymorphism in programming”, J. Comput. Syst. Sci.,17, 348–375 (1978).
L. Cardelli, “Basic polymorphic typechecking”, Sci. Comput. Program.,8, No. 2, 147–172 (1987).
A. Demers, J. Donahue, R. Teitelbaum, and J. Williams, “Encapsulated data types and polymorphic procedures”, in: Data in Programming Languages [Russian translation], Mir, Moscow (1982), pp. 214–242.
V. N. Agafonov, “Data types and data abstraction in programming languages (a survey)”, in: Data in Programming Languages [Russian translation], Mir, Moscow (1982), pp. 266–327.
A. V. Zamulin, Data Types in Programming Languages and Databases [in Russian], Nauka, Novosibirsk (1987).
D. Scott, “A sketch of a mathematical theory of computation”, Kibern. Sb., Novaya Ser., No. 14, 107–121 (1977).
N. S. Nikitchenko, “Construction of classes of generalized computable functions and functionals”, Kiev (1984). Unpublished manuscript, UkrNIINTI 15.05.84, No. 856 Uk-84.
Additional information
Translated from Kibernetika, No. 1, pp. 29–34, January–February, 1991.
Rights and permissions
About this article
Cite this article
Nikitchenko, N.S., Trubchaninov, G.G. Polymorphic program models. Cybern Syst Anal 27, 39–46 (1991). https://doi.org/10.1007/BF01068645
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01068645