References
D. B. Bui and V. N. Red'ko, “Programmological aspects of the fixed point method,” Kibern. Sistem. Anal., No. 5, 158–167 (1994).
D. Scott, “An outline of mathematical computation theory,” Kibern. Sb., new series, No. 14, 107–121, Mir, Moscow (1977).
D. Scott, “Lattice theory, data types, and semantics,” in: Data in Programming Languages. Abstraction and Typology [Russian translations], Mir, Moscow (1982), pp. 25–53.
D. Scott, “Domains in denotational semantics,” in: Mathematical Logic in Programming [Russian translations], Mir, Moscow (1991), pp. 58–118.
D. S. Scott, “Lectures on a mathematical theory of computation,” in: Theoretical Foundation of Programming Methodology (1982), pp. 145–292.
A. Tarski, “A lattice-theoretical fixpoint theorem and its applications,” Pacific J. Math.,5, No. 2, 285–309 (1955).
S. Abian and A. Brown, “A theorem on partially ordered sets, with application to fixed point theorems,” Canad. J. Math.,13, No. 1, 78–82 (1961).
N. Bourbaki, Set Theory [Russian translation], Mir, Moscow (1965).
R. Engelking, General Topology [Russian translation], Mir, Moscow (1986).
H. P. Barendregt, The Lambda Calculus: Its Syntax and Semantics [Russian translation], Mir, Moscow (1985).
L. A. Skornyakov, Elements of the Theory of Structures [in Russian], Nauka, Moscow (1982).
G. Birkhoff, Lattice Theory [Russian translation], Nauka, Moscow (1984).
Additional information
Translated from Kibernetika i Sistemnyi Analiz, No. 1, pp. 113–121, January–February, 1995.
Rights and permissions
About this article
Cite this article
Bui, D.B., Red'ko, V.N. Fixed points and closure operators: Programmological aspects. Cybern Syst Anal 31, 96–102 (1995). https://doi.org/10.1007/BF02366800
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02366800