Colimits in the Category DCPO

@article{Fiech1996ColimitsIT,
  title={Colimits in the Category DCPO},
  author={Adrian Fiech},
  journal={Mathematical Structures in Computer Science},
  year={1996},
  volume={6},
  pages={455-468}
}
  • Adrian Fiech
  • Published 1996 in Mathematical Structures in Computer Science
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. 0 Introduction Colimits play an important role in modeling subtyping relations. Given a domain of type names D, it is common to interpret it with a… CONTINUE READING

Citations

Publications citing this paper.
Showing 1-4 of 4 extracted citations

References

Publications referenced by this paper.
Showing 1-10 of 13 references

] Polymorphic Lambda Calculus and Subtyping , in preparation Gierz G . [ 1982 ] Colimits of Continuous Lattices

G. Gierz, H. HofmannK., K. Keimel, D. LawsonJ., M. Mislove
Journal of Pure and Applied Algebra • 1993

Homomorphisms, Bilimits and Saturated Domains, unpublished draft communicated by Michael

P. Taylor
Huth in April • 1992

Private notes communicated by Michael

A. Jung
Huth in April • 1992

Basic category theory for computer scientists

Foundations of computing • 1991
View 1 Excerpt

Abstract and Concrete Categories, John Wiley&Sons

J. Adamek, H. Herrlich, G. Strecker
1990
View 1 Excerpt

Cartesian Closed Categories of Domains, CWI Tract

A. Jung
1989

Colimits of Continuous Lattices

G. Gierz
Journal of Pure and Applied Algebra • 1982

Domains for Denotational Semantics

D. S. Scott
LNCS vol • 1982

The Category of Complete Partial Order : a Tool for Making Meanings

G. Plotkin
In Proceedings of the Summer School on Foundations of Artificial Inteligence and Computer Science, • 1978