Spaces of maximal points

Mathematical Structures in Computer Science

Volumn 7, Issue 5, 1997, Pages 543-555

  Lawson, Jimmie ^a  

^a LOUISIANA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0346268480     PISSN: 09601295     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0960129597002363     Document Type: Article

References (17)

1. Abramsky, S. and Jung, A. (1995) Domain theory. In: Abramsky, S. et al. (eds.) Handbook of Logic in Computer Science 3, Clarendon Press.
2. Bourbaki, N. (1989) General Topology (English Translation), Springer-Verlag.
3. Davey, B. and Priestley, H. (1990) Introduction to Lattices and Order, Cambridge University Press.
4. Edalat, A. (1995) Dynamical systems, measures and fractals via domain theory. Information and Computation 120 (1) 32–48.
5. Edalat, A. (1996) Power domains and iterated function system. Information and Computation 124 182–197.
6. Edalat, A. and R. Heckmann. (1996) A computational model for metric spaces, to appear.
7. Gierz, G., Hofmann, K., Keimel, K., Lawson, J., Mislove, M. and Scott, D. (1980) A Compendium of Continuous Lattices, Springer-Verlag.
8. Hoffmann, R.-E. (1985) The Fell compactification revisited. In: Hoffmann, R.-E. and Hofmann, K. (eds.) Continuous Lattices and Their Applications, Marcel Dekker 57–116.
9. Hofmann, K. H. and Lawson, J. (1978) The spectral theory of distributive continuous lattices. Trans. Amer. Math. Soc. 246 285–310. Kamimura, T. and Tang, A. (1984) Total objects of domains. Theoretical Computer Sci. 34 275–288.
10. Lacombe, D. (1959) Quelques procedes de definitions en topologie recursif. In: Constructivity in Mathematics, North-Holland 129–158.
11. Lawson, J. (1979) The duality of continuous posets. Houston J. Math. 5 357–394.
12. Lawson, J. (1988) The versatile continuous order. In: Main, M., Melton, A. and Mislove, M. (eds.) Mathematical Foundations of Programming Semantics. Springer-Verlag Lecture Notes in Computer Science 298 134–160.
13. Lawson, J. (1991) Order and strongly sober compactifications. In: Reed, G., Roscoe, A. and Wachter, R. (editors), Topology and Category Theory in Computer Science, Oxford University Press 179–205.
14. Martin-Lof, P. (1970) Notes on Constructive Mathematics, Almquist & Wiksell.
15. Nachbin. L. (1965) Topology and Order, Van Nostrand.
16. Scott, D. (1970) Outline of the mathematical theory of computation. In: Proc. 4th Princeton Conference on Informations Science 169–176.
17. Weihrauch, K. and Schreiber, U. (1981) Embedding metric spaces into cpo’s. Theoretical Computer Sci. 16 5–24.