Hostname: page-component-74656f9884-8r8nv Total loading time: 0 Render date: 2026-11-10T10:34:45.287Z Has data issue: false hasContentIssue false
  • English
  • Français

Colimits in the category DCPO

Published online by Cambridge University Press:  19 April 2018

Adrian Fiech
Adrian Fiech*
Affiliation:
Department of Computer Science, Memorial University of Newfoundland, St John's NF A1B 3X5 Canada Email fiech@cs.mun.ca
Get access Rights & Permissions [Opens in a new window]

Abstract

We establish sufficient and necessary conditions for a natural sink to be a colimit in DCPO. Based on these conditions, we show how to construct a colimit for any functor F from a small category Ω into the category DCPO. This demonstrates that the category DCPO is cocomplete. We also investigate under what conditions the colimit object is algebraic.

Information

Type
Research Article
Information
Mathematical Structures in Computer Science , Volume 6 , Issue 5 , October 1996 , pp. 455 - 468
Copyright
Copyright © Cambridge University Press 1996

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

Adamek, J., Herrlich H. and Strecker, G. (1990) Abstract and Concrete Categories, John Wiley and Sons.Google Scholar
Fiech, A. (1993) Category of Δ-Functors, Proceedings of the Ninth Conference on Mathematical Foundations of Programming Semantics, 1993. Springer-Verlag Lecture Notes in Computer Science 802 567–586.CrossRefGoogle Scholar
Fiech, A. and Schmidt, D. (1994) Polymorphic Lambda Calculus and Subtyping, Technical Report 94-7, Kansas State University (to appear in Theoretical Computer Science).Google Scholar
Gierz, G. (1982) Colimits of Continuous Lattices. Journal of Pure and Applied Algebra 23 137–144.Google Scholar
Gierz, G., Hofmann, K.H., Keimel, K., Lawson, J.D., Mislove, M. and Scott, D.S. (1980) A Compendium of Continuous Lattices, Springer-Verlag.Google Scholar
Huwig, H. and Poigne, A. (1990) A Note on Inconsistencies Caused by Fixpoints in a Cartesian Closed Category. Theoretical Computer Science 73 101–112.Google Scholar
Jung, A. (1992) Private notes communicated by Michael Huth in April 1992.Google Scholar
Jung, A. (1989) Cartesian Closed Categories of Domains, CWI Tract 66, Amsterdam.Google Scholar
Meseguer, J. (1977) On Order-Complete Universal Algebra and Enriched Functorial Semantics. Proceedings of the 1977 International FCT-Conference, Poznan-Kornik, Poland, September 1977 294–301.Google Scholar
Pierce, B.C. (1991) Basic Category Theory for Computer Scientists, The MIT Press, Cambridge.Google Scholar
Plotkin, G. (1978) The Category of Complete Partial Order : a Tool for Making Meanings. In: Proceedings of the Summer School on Foundations of Artificial Inteligence and Computer Science, University di Pisa.Google Scholar
Scott, D. S. (1982) Domains for Denotational Semantics. Springer-Verlag Lecture Notes in Computer Science. Google Scholar
Smyth, M.B. and Plotkin, G.D. (1982) The Category-Theoretic Solution of Recursive Domain Equations. SIAM Journal of Computing 11 761–783.Google Scholar
Taylor, P. (1992) Homomorphisms, Bilimits and Saturated Domains (unpublished draft communicated by Michael Huth in April 1992).Google Scholar