Skip to main content
Conference Proceedings

Colimits of order-sorted specifications

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1998) 1376 316-332
DOI: 10.1007/3-540-64299-4_42
11Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

We prove cocompleteness of the category of CASL signatures, of monotone signatures, of strongly regular signatures and of strongly locally filtered signatures. This shows that using these signature categories is compatible with a pushout or colimit based module system.

Cite

CITATION STYLE

APA

Mossakowski, T. (1998). Colimits of order-sorted specifications. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1376, pp. 316–332). Springer Verlag. https://doi.org/10.1007/3-540-64299-4_42

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free