Skip to main content

What Is a Derived Signature Morphism?

  • Conference paper
  • First Online:
Recent Trends in Algebraic Development Techniques (WADT 2015)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 9463))

Included in the following conference series:

Abstract

The notion of signature morphism is basic to the theory of institutions. It provides a powerful primitive for the study of specifications, their modularity and their relations in an abstract setting. The notion of derived signature morphism generalises signature morphisms to more complex constructions, where symbols may be mapped not only to symbols, but to arbitrary terms. The purpose of this work is to study derived signature morphisms in an institution-independent way. We will recall and generalize two known approaches to derived signature morphisms, introduce a third one, and discuss their pros and cons. We especially study the existence of colimits of derived signature morphisms. The motivation is to give an independent semantics to the notion of derived signature morphism, query and substitution in the context of the Distributed Ontology, Modeling and Specification Language DOL.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Institutional subscriptions

Notes

  1. 1.

    Cmp. the work on the new OMG standard. Distributed Ontology, Modeling and Specification Language (DOL), see http://ontoiop.org.

  2. 2.

    Such an approach is used by the HDTP framework, described in [23].

  3. 3.

    Simplified version from [23].

  4. 4.

    The category \(\mathbf {Set}\) has all sets as objects and all functions as morphisms.

  5. 5.

    \(\mathbb {CAT}\) is the quasi-category of all categories, where “quasi” means that it lives in a higher set-theoretic universe.

  6. 6.

    The original notion from [4] is a lax variant of this: a morphism \(\rho \rightarrow \rho '\circ (I_2 \cdot \theta )\) is given instead of equality.

  7. 7.

    We give only a brief summary here, simplifying and adapting notation.

References

  1. nLab: Span. http://ncatlab.org/nlab/show/span

  2. Borzyszkowski, T.: Logical systems for structured specifications. Theor. Comput. Sci. 286, 197–245 (2002)

    Article  MathSciNet  Google Scholar 

  3. Cornelius, F., Baldamus, M., Ehrig, H., Orejas, F.: Abstract and behaviour module specifications. Math. Struct. Comput. Sci. 9(1), 21–62 (1999)

    Article  MathSciNet  Google Scholar 

  4. Diaconescu, R.: Grothendieck institutions. Appl. Categorical Struct. 10, 383–402 (2002)

    Article  MathSciNet  Google Scholar 

  5. Diaconescu, R.: Herbrand theorems in arbitrary institutions. Inf. Process. Lett. 90, 29–37 (2004)

    Article  MathSciNet  Google Scholar 

  6. Diaconescu, R.: Institution-Independent Model Theory. Birkhäuser, Basel (2008)

    MATH  Google Scholar 

  7. Diaconescu, R., Goguen, J., Stefaneas, P.: Logical support for modularisation. In: Huet, G., Plotkin, G. (eds.) Proceedings of a Workshop on Logical Frameworks (1991)

    Google Scholar 

  8. Diskin, Z., Kadish, B.: A graphical yet formalized framework for specifying view systems. In: Manthey, R., Wolfengagen, V. (eds.) Advances in Databases and Information Systems 1997, Proceedings of the First East-European Symposium on Advances in Databases and Information Systems, ADBIS 1997, St Petersburg, 2–5 September 1997 (1997)

    Google Scholar 

  9. Diskin, Z., Maibaum, T., Czarnecki, K.: Intermodeling, queries, and kleisli categories. In: de Lara, J., Zisman, A. (eds.) Fundamental Approaches to Software Engineering. LNCS, vol. 7212, pp. 163–177. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  10. Ehrig, H., Baldamus, M., Cornelius, F., Orejas, F.: Theory of algebraic module specification including behavioral semantics and constraints. In: Nivat, M., Rattray, C., Rus, T., Scollo, G. (eds.) AMAST 1991. Workshops in Computing, pp. 145–172. Springer, Heidelberg (1992)

    Google Scholar 

  11. Ehrig, H., Baldamus, M., Orejas, F.: New concepts of amalgamation and extension for a general theory of specifications. In: Bidoit, M., Choppy, C. (eds.) Abstract Data Types 1991 and COMPASS 1991. LNCS, vol. 655. Springer, Heidelberg (1993)

    MATH  Google Scholar 

  12. Goguen, J.A., Burstall, R.M.: A study in the foundations of programming methodology: specifications, institutions, charters and parchments. In: Poigné, A., Pitt, D.H., Rydeheard, D.E., Abramsky, S. (eds.) Category Theory and Computer Programming. LNCS, vol. 240, pp. 313–333. Springer, Heidelberg (1986)

    Chapter  Google Scholar 

  13. Goguen, J.A., Burstall, R.M.: Institutions: Abstract model theory for specification and programming. J. Assoc. Comput. Mach. 39, 95–146 (1992). Predecessor in: LNCS, vol. 164, pp. 221–256 (1984)

    Article  MathSciNet  Google Scholar 

  14. Goguen, J.A., Roşu, G.: Institution morphisms. Formal Aspects Comput. 13, 274–307 (2002)

    Article  Google Scholar 

  15. Goguen, J.A., Thatcher, J.W., Wagner, E.G.: An initial algebra approach to the specification, correctness and implementation of abstract data types. In: Yeh, R.T. (ed.) Current Trends in Programming Methodology - vol. IV: Data Structuring, pp. 80–149. Prentice-Hall (1978)

    Google Scholar 

  16. Honsell, F., Longley, J., Sannella, D., Tarlecki, A.: Constructive data refinement in typed lambda calculus. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 161–176. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  17. Kutz, O., Mossakowski, T., Lücke, D.: Carnap, goguen, and the hyperontologies: logical pluralism and heterogeneous structuring in ontology design. Log. Univers. 4(2), 255–333 (2010)

    Article  MathSciNet  Google Scholar 

  18. Lack, S.: A 2-categories companion. In: Baez, J.C., May, J.P. (eds.) Towards Higher Categories. The IMA Volumes in Mathematics and its Applications, vol. 152, pp. 105–191. Springer, New York (2010)

    Chapter  Google Scholar 

  19. Mossakowski, T., Autexier, S., Hutter, D.: Development graphs - proof management for structured specifications. J. Logic Algebraic Program. 67(1–2), 114–145 (2006). http://www.sciencedirect.com/science?_ob=GatewayURL&_origin=CONTENTS&_method=citationSearch&_piikey=S1567832605000810&_version=1&md5=7c18897e9ffad42e0649c6b41203f41e

    Article  MathSciNet  Google Scholar 

  20. Sannella, D.T., Burstall, R.M.: Structured theories in LCF. In: Protasi, M., Ausiello, G. (eds.) CAAP 1983. LNCS, vol. 159, pp. 377–391. Springer, Heidelberg (1983)

    Google Scholar 

  21. Sannella, D., Tarlecki, A.: Foundations of Algebraic Specification and Formal Software Development. Monographs in Theoretical Computer Science. Springer, Berlin (2012)

    Book  Google Scholar 

  22. Schröder, L., Mossakowski, T., Tarlecki, A., Klin, B., Hoffman, P.: Amalgamation in the semantics of casl. Theor. Comput. Sci. 331(1), 215–247 (2005)

    Article  MathSciNet  Google Scholar 

  23. Schwering, A., Krumnack, U., Kühnberger, K.U., Gust, H.: Syntactic principles of heuristic-driven theory projection. J. Cogn. Syst. Res. 10(3), 251–269 (2009). Special Issue on Analogies - Integrating Cognitive Abilities

    Article  Google Scholar 

  24. Szigeti, J.: On limits and colimits in the Kleisli category. Cahiers de Topologie et Géométrie Différentielle Catégoriques 24(4), 381–391 (1983)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Till Mossakowski .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Mossakowski, T., Krumnack, U., Maibaum, T. (2015). What Is a Derived Signature Morphism?. In: Codescu, M., Diaconescu, R., Țuțu, I. (eds) Recent Trends in Algebraic Development Techniques. WADT 2015. Lecture Notes in Computer Science(), vol 9463. Springer, Cham. https://doi.org/10.1007/978-3-319-28114-8_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-28114-8_6

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-28113-1

  • Online ISBN: 978-3-319-28114-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics