Colimits of order-sorted specifications

DOI10.1007/3-540-64299-4_42MaRDI QIDQ3839060zbMATH OpenFDO

Authors Till Mossakowski

Publication date 3 December 1998

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-64299-4_42

zbMATH Keywords

algebraic specification languagecocompletenessorder-sorted specificationssignatures

Mathematics Subject Classification ID

Categories admitting limits (complete categories), functors preserving limits, completions (18A35) Abstract data types; algebraic specification (68Q65)

Review text

The author proves the cocompleteness of the category of CASL signatures, of monote signatures, of strongly regular signatures and of strongly filtered signatures. For the entire collection see [Zbl 0889.00030].

Cited in

(7)

• A computational framework for conceptual blending
• Amalgamation in the semantics of CASL
• Relating CASL with other specification languages: the institution level.
• Towards behavioral Maude: behavioral membership equational logic
• ASP, amalgamation, and the conceptual blending workflow
• scientific article; zbMATH DE number 5360218 (Why is no real title available?)
• On the Completeness of Context-Sensitive Order-Sorted Specifications

This page was built for publication: Colimits of order-sorted specifications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839060)