Skip to main content
SpringerLink
Log in

Tool design for structuring mechanisms for algebraic specification languages with initial semantics

  • Contributions
  • Conference paper
  • First Online:
Recent Trends in Data Type Specification (ADT 1995, COMPASS 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1130))

  • 164 Accesses

Abstract

In [18] a ML-program for computations in category theory, including an implementation of the semantics of specification-building operations for the language CLEAR [6] is presented. We propose a similar approach but use object oriented methods to achieve better abstractness, reusability and efficiency. We prove correctness and the worst case time bounds of the basic algorithm computing colimits on set diagrams. We show how the comma category representations of signatures, specifications and attributed graphs suggests colimit algorithms on the corresponding diagrams.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Lee A. Stepanov. The standard template library. Technical report, Hewlett-Packard Laboratories, September 20 1994. available via ftp.cs.rpi.edu as pub/stl/doc.ps.Z.

    Google Scholar 

  2. J. Adádamek, H. Herrlich, and G. E. Strecker. Abstract and Concrete Categories. Series in Pure and Applied Mathematics. Wiley, New York, 1990.

    Google Scholar 

  3. A. Asperti and G. Longo. Categories, Types and Structures. Foundations of Computing Series. MIT Press, 1991.

    Google Scholar 

  4. M. Barr and C. Wells. Category Theory for Computing Science. Series in Computer Science. Prentice Hall International, London, 1990.

    Google Scholar 

  5. G. Booch. Object Oriented Analysis and Design. Benjamin/Cummings, 2nd edition, 1994.

    Google Scholar 

  6. R. M. Burstall and J. A. Goguen. The semantics of CLEAR, a specification language. In D. Bjøner, editor, Abstract Software Specification, Proc. 1979 Copenhagen Winter School, LNCS 86, pages 292–332. Springer, 1980.

    Google Scholar 

  7. I. Claßen. Revised ACT ONE: Categorical constructions for an algebraic specification language. In Categorical Methods in Computer Science, LNCS 393, pages 124–141. Springer, 1989.

    Google Scholar 

  8. I. Claßen. Compositionality of Application Oriented Structuring Mechanisms for Algebraic Specification Languages with Initial Semantics. PhD thesis, Technische Universität Berlin, 1993.

    Google Scholar 

  9. I. Claßen and M. Löwe. Scheme evolution in object-oriented models — a graph transformation approach. In ICSE '95 — 17th Workshop on Formal Methods Application in Software Engineering Practice, Seattle, Washington, April 1995.

    Google Scholar 

  10. A. Stepanov D. R. Musser. Generic programming. In LNCS 358, pages 13–25. Springer, 1989.

    Google Scholar 

  11. H. Ehrig and B. Mahr. Fundamentals of Algebraic Specification 1, volume 6 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1985.

    Google Scholar 

  12. S. Erdmann and I. Classen. Alpha — a class library for a metamodel. In Proc. AMAST '96, to appear, 1996.

    Google Scholar 

  13. J. A. Goguen. A categorical manifesto. Technical Monograph PRG-72, Oxford University Computing Laboratory, 1989.

    Google Scholar 

  14. M. Jazajery. Component programming — a fresh look at software components. In Proceedings of the 5th European Software Engineering Conference, Sitges, Spain, September 25–28 1995.

    Google Scholar 

  15. M. Löwe and M. Beyer. AGG — An implementation of algebraic graph rewriting. In 5th Intl. Conf. on Rewriting Techniques and Applications, RTA-93, volume 690 of LNCS, pages 451–456. Springer, 1993.

    Google Scholar 

  16. D. R. Musser. Rationale for adding hash tables to the C++ standard template library. Technical report, February, 20 1995. available from ftp.cs.rpi.edu as pub/stl/hashrationale.ps.

    Google Scholar 

  17. J. Padberg. Kolimeskonstruktionen in Algebraischen Spezifikationssprachen. Studienarbeit, Technische Universität Berlin, 1991.

    Google Scholar 

  18. D. E. Rydeheard and R. M. Burstall. Computational Category Theory. International Series in Computer Science. Prentice Hall, 1988.

    Google Scholar 

  19. D. T. Sannella. A set-theoretic semantics for CLEAR. Acta Informatica, 21:443–472, 1984.

    Google Scholar 

  20. G. Schied. Über Graphgrammatiken, eine Spezifikationsmethode für Programmiersprachen und verteilte Regelsysteme. PhD thesis, Universität Erlangen-Nürnberg, 1991.

    Google Scholar 

  21. R.E. Tarjan. Data Structures and Network Algorithms, volume 44. CBMS-NSF Regional Conference Series in Applied Mathematics, 1983.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich 20 Informatik, Technische Universität Berlin, Franklinstraße 28/29, 10587, Berlin, Germany

    Dietmar Wolz

Authors
  1. Dietmar Wolz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Magne Haveraaen Olaf Owe Ole-Johan Dahl

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wolz, D. (1996). Tool design for structuring mechanisms for algebraic specification languages with initial semantics. In: Haveraaen, M., Owe, O., Dahl, OJ. (eds) Recent Trends in Data Type Specification. ADT COMPASS 1995 1995. Lecture Notes in Computer Science, vol 1130. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61629-2_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-61629-2_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61629-0

  • Online ISBN: 978-3-540-70642-7

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation