Pushouts of order-sorted algebraic specifications

DOI10.1007/BFB0014312MaRDI QIDQ4375636zbMATH OpenFDO

Authors Friederike Nickl, Anne Elisabeth Haxthausen

Publication date 8 February 1998

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

Full work available at URL https://doi.org/10.1007/BFB0014312

zbMATH Keywords

order-sorted algebraic specificationspushoutsspecification morphisms

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• Order-sorted algebraic specifications with higher-order functions
• Order-sorted algebraic specifications with higher-order functions
• Stability of termination and sufficient-completeness under pushouts via amalgamation
• Parametrization for order-sorted algebraic specification
• scientific article; zbMATH DE number 3866562

Cited in

(9)

• Amalgamation in the semantics of CASL
• Order-sorted algebra solves the constructor-selector, multiple representation, and coercion problems
• Relating CASL with other specification languages: the institution level.
• Semantics of temporal classes
• Homomorphism preserving algebraic specifications require hidden sorts
• Stability of termination and sufficient-completeness under pushouts via amalgamation
• Order-Sorted Parameterization and Induction
• scientific article; zbMATH DE number 10083 (Why is no real title available?)
• A language-independent proof system for full program equivalence

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

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