Summary: Fixed point theorems are an important tool in the whole of mathematics. For instance, the denotational semantics of programming languages is essentially based on such theorems. Partially ordered sets and Kleene’s fixed point theorem are the mathematical support for a great amount of semantic models ([{\it J. de Bakker}, Mathematical theory of program correctness. Englewood Cliffs, New Jersey, etc.: Prentice-Hall (1980;

Zbl 0452.68011)] and [{\it J. E. Stoy}, Denotational semantics: the Scott-Strachey approach to programming language theory. Cambridge, Massachusetts; London: The MIT Press (1981;

Zbl 0503.68059)]). In the last years attempts have been made to replace partially ordered sets by metric spaces, and Kleene’s fixed point theorem by the Banach contraction principle ([{\it J. W. de Bakker} and {\it J. I. Zucker}, Processes of the denotational semantics of concurrency. Foundations of computer science IV. Distributed systems. Part 2: Semantics and logic, Math. Cent. Tracts 159, 45--100 (1983;

Zbl 0508.68010)] and [{\it E. G. Manes} and {\it M. A. Arbib}, Algebraic approaches to program semantics. New York etc.: Springer (1986;

Zbl 0599.68008)]).
The aim of the present paper is to prove that the latter theorem may be regarded as a particular case of the former. This is done by embedding a metric space in an ordered set. We note that the problem of the connection between these two fixed point theorems has been solved, in some special cases only, by the author and {\it C. Popescu} [Bull. Math. Soc. Sci. Math. Répub. Soc. Roum., Nouv. Sér. 31(79), 99-106 (1987;

Zbl 0639.54015)] and by {\it C. Livercy} [Théorie des programmes. Schémes, preuves, sémantique. Paris: Bordas (1978;

Zbl 0416.68007)] (for compact metric spaces and for compact intervals of the real line, respectively).