Skip to main content
SpringerLink
Log in
Book cover

Category Theory and Computer Programming pp 225–241Cite as

Finite approximation of spaces

Extended abstract

  • Part II Research Contributions
  • Chapter
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 240))

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Arbib,M., and Manes,E., The greatest fixpoint approach to data types, Proc. 3rd Workshop on Categorical and Algebraic Methods in Computer Science, Dortmund (1980)

    Google Scholar 

  2. Avizienis, A., Signed-digit representations for fast parallel arithmetic, IRE Trans. EC 10 (1961) 389–400

    Google Scholar 

  3. Bourbaki,N., Elements of Mathematics: General Topology Part I, Hermann/Addison-Wesley (1966)

    Google Scholar 

  4. Brouwer, L., Collected Works Vol. 1, ed. A. Heyting, North-Holland Amsterdam (1975)

    Google Scholar 

  5. Fourman,M., and Grayson,R., Formal Spaces, L.E.J. Brouwer Centenary Symposium, North Holland (1982) 107–122.

    Google Scholar 

  6. Gierz,G., et al., A Compendium of Continuous Lattices, Springer (1980)

    Google Scholar 

  7. Gunter, C., Profinite solutions for recursive domain equations (Thesis), T.R. CMU-CS-85-107, Carnegie-Mellon University, Pittsburgh (1985)

    Google Scholar 

  8. Johnstone,P., Stone Spaces, Cambridge University Press (1982)

    Google Scholar 

  9. Johnstone,P., The point of pointless topology, Bull.Am.Math.Soc. (1983)

    Google Scholar 

  10. Martin-Lof, P., Notes on Constructive Mathematics, Almqvist & Wicksell, Stockholm (1970)

    Google Scholar 

  11. Parikh, R., The problem of vague predicates, in: Cohen, R.S., & Wartovsky (eds.), Language, Logic and Method, Reidel, (1983) 241–261

    Google Scholar 

  12. Plotkin, G., A powerdomain construction, SIAM J. Comput. 5 (1976) 452–487

    Google Scholar 

  13. Plotkin,G., Lecture notes on domain theory, Edinburgh

    Google Scholar 

  14. Reynolds, J., On the relation between direct and continuation semantics, ICALP '74, Springer LNCS 14 (1974) 141–156

    Google Scholar 

  15. Scott, D., The lattice of flow diagrams, Lecture Notes in Math. 188 (ed. E. Engeler), Springer (1971) 311–366

    Google Scholar 

  16. Scott,D., Outline of a mathematical theory of computation, Proc. 4th Ann. Princeton Conf. on Inf. Sci. and Systems, (1970) 65–106

    Google Scholar 

  17. Scott, D., Domains for denotational semantics, ICALP '82, Springer LNCS 140 (1982) 577–613

    Google Scholar 

  18. Smyth, M., Effectively given domains, Theor.Comp.Sci. 5 (1977) 257–274

    Google Scholar 

  19. The largest cartesian closed category of domains, Theor.Comp. Sci. 27 (1983) 109–119

    Google Scholar 

  20. Smyth, M., Predicate transformers and power domains, ICALP '83, Springer LN 154 (1983) 662–675

    Google Scholar 

  21. Smyth, M., and Plotkin, G., The category-theoretic solution of recursive domain equations, SIAM J. Comput. 11 (1982) 761–783

    Google Scholar 

  22. Wiedmer,E., Exaktes Rechnen mit reellen Zahlen... (Thesis) ETH Zurich (1977); also Theor.Comp.Sci. (1979)

    Google Scholar 

  23. Winskel,G., and Larsen,K., Using information systems to solve recursive domain equations effectively, Semantics of Data Types, ed. G.Kahn et al., Springer LN 173 (1984) 109–129.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computing, Imperial College, SW7 2BZ, London

    M. B. Smyth

Authors
  1. M. B. Smyth
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

David Pitt Samson Abramsky Axel Poigné David Rydeheard

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Smyth, M.B. (1986). Finite approximation of spaces. In: Pitt, D., Abramsky, S., Poigné, A., Rydeheard, D. (eds) Category Theory and Computer Programming. Lecture Notes in Computer Science, vol 240. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-17162-2_125

Download citation

  • DOI: https://doi.org/10.1007/3-540-17162-2_125

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-17162-1

  • Online ISBN: 978-3-540-47213-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation