Skip to main content

A category-theoretic semantics for unbounded indeterminacy

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

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

  • 137 Accesses

Abstract

In this paper we give a category-theoretic semantics for a simple imperative language featuring unbounded indeterminacy. This semantics satisfies the categorical analogues of continuity and has the meaning of while loops defined as colimits of ω-diagrams. Furthermore, it collapses via an abstraction function to a semantics that is fully abstract, and coincides with the operational semantics. The abstraction function is the only discontinuous function appearing in our semantics.

Supported by NSF grant CCR 8818979

Supported in part by an NSF graduate fellowship

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. S. Abramsky. On semantic foundations for applicative multiprogramming. In J. Diaz, editor, Proceedings of the Tenth International Conference On Automata, Languages And Programming, pages 1–14, New York, 1983. Springer-Verlag.

    Google Scholar 

  2. K. R. Apt and E.-R. Olderog. Proof rules and transformations dealing with fairness. Sci. Comput. Prog., 3:65–100, 1983.

    Article  MATH  MathSciNet  Google Scholar 

  3. K. R. Apt and G. D. Plotkin. Countable nondeterminism and random assignment. Journal Of The ACM, 33(4):724–767, 1986.

    Article  MATH  MathSciNet  Google Scholar 

  4. G. Boudol. Semantique Operationalle et Algebrique Des Programmes Recursifs Non-Deterministes. PhD thesis, University de Paris VII, 1980. These d'Etat.

    Google Scholar 

  5. T. Coquand. Categories of embeddings. In Proceedings of the Third IEEE Symposium on Logic In Computer Science, 1988.

    Google Scholar 

  6. N. Francez. Fairness. Springer-Verlag, 1986.

    Google Scholar 

  7. D. Lehmann. Categories for Fixed-point Semantics. PhD thesis, University of Warwick, 1976.

    Google Scholar 

  8. P. Panangaden. Abstract interpretation and indeterminacy. In Proceedings of the 1984 CMU Seminar on Concurrency, pages 497–511, 1985. LNCS 197.

    Google Scholar 

  9. G. D. Plotkin. A powerdomain construction. SIAM Journal of Computing, 5(3):452–487, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  10. P. Panangaden and V. Shanbhogue. On the expressive power of indeterminate primitives. Technical Report 87-891, Cornell University, Computer Science Department, November 1987.

    Google Scholar 

  11. P. Panangaden and E. W. Stark. Computations, residuals and the power of indeterminacy. In Timo Lepisto and Arto Salomaa, editors, Proceedings of the Fifteenth ICALP, pages 439–454. Springer-Verlag, 1988. Lecture Notes in Computer Science 317.

    Google Scholar 

  12. M. B. Smyth. Powerdomains. Journal of Computer and System Sciences, 16:23–36, 1978.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

M. Main A. Melton M. Mislove D. Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Panangaden, P., Russell, J.R. (1990). A category-theoretic semantics for unbounded indeterminacy. In: Main, M., Melton, A., Mislove, M., Schmidt, D. (eds) Mathematical Foundations of Programming Semantics. MFPS 1989. Lecture Notes in Computer Science, vol 442. Springer, New York, NY. https://doi.org/10.1007/BFb0040265

Download citation

  • DOI: https://doi.org/10.1007/BFb0040265

  • Published:

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-0-387-97375-3

  • Online ISBN: 978-0-387-34808-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics