[1] |
Scott, D., Outline of the mathematical theory of computation, Proc. 4th Princeton Conference on Information Science (1970) |
[2] |
Lacombe, D., Quelques procédés de définitions en topologie recursif, (Constructivity in Mathematics (1959), North-Holland: North-Holland Amsterdam), 129-158 · Zbl 0089.00701 |
[3] |
Martin-Löf, P., Notes on Constructive Mathematics (1970), Almquist & Wiksell: Almquist & Wiksell Stockholm · Zbl 0273.02021 |
[4] |
Smyth, M. B., Effectively given domains, Theoret. Comput. Sci., 5, 257-274 (1977) · Zbl 0429.03028 |
[5] |
Bourbaki, N., General Topology, Part 2 (1966), Addison-Wesley: Addison-Wesley Reading, MA · Zbl 0145.19302 |
[6] |
Egli, H.; Constable, R. L., Computability concepts for programming language semantics, Theoret. Comput. Sci., 2, 133-145 (1976) · Zbl 0352.68042 |
[7] |
Markowsky, G.; Rosen, B. K., Bases for chain-complete posets, IBM Research Report RC 5363 (1975) · Zbl 0329.06001 |
[8] |
Scott, D., Continuous lattices, (Lecture Notes in Mathematics, 274 (1972), Springer: Springer Berlin) · Zbl 0239.54006 |
[9] |
M. Nivat and A. Arnold, Calculus infinis, interpretations metriques et plus grands points fixes, TR 78-19, Laboratoire Informatique Théorique et Programmation, Paris.; M. Nivat and A. Arnold, Calculus infinis, interpretations metriques et plus grands points fixes, TR 78-19, Laboratoire Informatique Théorique et Programmation, Paris. · Zbl 0486.68013 |
[10] |
Wright, J. B.; Wagner, E. G.; Thatcher, J. W., A uniform approach to inductive posets and inductive closure, Theoret. Comput. Sci., 7, 57-77 (1978) · Zbl 0732.06001 |
[11] |
Weihrauch, K.; Schreiber, U., Metric spaces defined by weighted algebraic cpo’s, (Budach, L., Fundamentals of Computation Theory, Bd., 2 (1979), Akademic Verlag: Akademic Verlag Berlin) · Zbl 0485.68040 |
[12] |
Kuratowski, K., Topology (1966), Academic Press: Academic Press New York, London · Zbl 0158.40901 |