On the complexity of specification morphisms

DOI10.1016/S0304-3975(97)00106-0MaRDI QIDQ1389688zbMATH OpenOpenAlexFDO

Authors Serafino Cicerone, Francesco Parisi-Presicce

Publication date 30 June 1998

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-3975(97)00106-0

zbMATH Keywords

specification morphism

Mathematics Subject Classification ID

Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 18648
• Constructing specification morphisms
• On the complexity of equivalence of specifications of infinite objects
• The complexity of weakly recognizing morphisms
• Expressing computational complexity in constructive type theory
• Functorial theory of parameterized specifications in a general specification framework
• Theoretical aspects of structured-modular composition programming: Computability of the operations of the algebra of morphisms
• The complexity of explicit constructions
• The complexity of explicit constructions

Cites work

• Foundations of rule-based design of modular systems
• scientific article; zbMATH DE number 3888893 (Why is no real title available?)
• scientific article; zbMATH DE number 3688740 (Why is no real title available?)
• scientific article; zbMATH DE number 44486 (Why is no real title available?)
• scientific article; zbMATH DE number 3511563 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1300972 (Why is no real title available?)
• scientific article; zbMATH DE number 1142323 (Why is no real title available?)

Cited in

(2)

• Constructing specification morphisms
• Theory blending: extended algorithmic aspects and examples

This page was built for publication: On the complexity of specification morphisms

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