Skip to main content
SpringerLink
Log in

Retracts of SFP objects

  • Conference paper
  • First Online:
Mathematical Foundations of Programming Semantics (MFPS 1985)

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

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Esorig, D. F. Probablistic Powerdomain, manuscript, 1983.

    Google Scholar 

  2. Kamimura, T. and Tang, A. "Algebraic Relations and Presentations," Theoretical Computer Science 27, 1983, pp. 39–60.

    Google Scholar 

  3. Kamimura, T. and Tang, A. "Effectively Given Spaces," Theoretical Computer Science 29, 1984, pp. 155–166.

    Google Scholar 

  4. Kamimura, T. and Tang, A. Finitely Continuous Posets, University of Kansas, TR-84-1, February, 1984.

    Google Scholar 

  5. Kozen, D. "Semantics of Probablistic Programs," 20th IEEE Symposium on Foundations of Computer Sciences 1979, pp. 101–114.

    Google Scholar 

  6. Main, G. M. "Semiring Module Powerdomains," University of Colorado, CU-CS-286-84, December 1984.

    Google Scholar 

  7. Plotkin, G. D. "A Powerdomain Construction," SIAM J. Computing, Vol. 5, No. 3, 1976, pp. 452–587.

    Google Scholar 

  8. Plotkin, G. D. "Tω as a Universal Domain," Journal of Computer System Sciences, Vol. 17 (1978), pp. 209–236.

    Google Scholar 

  9. Scott, D. "Continuous Lattices," Lecture Notes in Mathematics 274 (1970), pp. 97–136.

    Google Scholar 

  10. Scott, D. "Lattice Theory, Data Types and Semantics," Formal Semantics of Programming Languages (edited by R. Rustin), 1972, pp. 65–106.

    Google Scholar 

  11. Scott, D. Lecture on a Mathematical Theory of Computation, Oxford University Computing Laboratory, Techn. Monograph PRG-19, 1981.

    Google Scholar 

  12. Scott, D. "Domains for Denotational Semantics," Proc. of 9th ICALP, 1982.

    Google Scholar 

  13. Smyth, M. B. "Effectively Given Domains," Theoretical Computer Science, Vol. 5, 1977, pp. 257–274.

    Google Scholar 

  14. Smyth, M. B. "The Largest Cartesian Closed Category of Domains," Theoretical Computer Science 27, 1983, pp. 109–119.

    Google Scholar 

  15. Smyth, M. B. and Plotkin, G. D. "Categorical Solutions of Reflexive Domain Equations," Proceedings of FOCS, 1977.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Kansas, 66045, Lawrence, Kansas

    Tsutomu Kamimura & Adrian Tang

Authors
  1. Tsutomu Kamimura
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrian Tang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Austin Melton

Rights and permissions

Reprints and permissions

Copyright information

© 1986 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kamimura, T., Tang, A. (1986). Retracts of SFP objects. In: Melton, A. (eds) Mathematical Foundations of Programming Semantics. MFPS 1985. Lecture Notes in Computer Science, vol 239. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16816-8_29

Download citation

  • DOI: https://doi.org/10.1007/3-540-16816-8_29

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-16816-4

  • Online ISBN: 978-3-540-44861-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation