Advertisement

On the value of commutative diagrams in information modelling

  • Michael Johnson
  • C. N. G. Dampney
Part of the Workshops in Computing book series (WORKSHOPS COMP.)

Abstract

Category theory has been widely used in computer science, but usually in a very sophisticated manner. This paper argues that elementary category theoretic notions can have important value in the “real world” of software engineering. Perhaps the most elementary categorical notion is that of commutative diagram. Drawing on experience from several applications of category theory to information modelling in major business enterprises we show how commutative diagrams have been used to develop new methodologies in ER-modelling, constraint specification and process modelling. They also suggest new but as yet untested techniques for information model partitioning and information system architecture. The methodologies described here have a firm theoretical basis using the recently isolated theory of lextensive categories and this basis is briefly outlined.

Keywords

Commutative Diagram Static Constraint Information Model Query Language Category Theory 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. Barr and C. Wells, Category theory and computer science.Prentice Hall, 1990.Google Scholar
  2. [2]
    A. Carboni, S. Lack and R.F.C. Walters, Introduction to extensive and distributive categories, Pure Mathematics Report92–9, University of Sydney, 1992.Google Scholar
  3. [3]
    P.P.S. Chen, The entity relationship model—towards a unified view of data, ACM Transactions on Database Systems, 1 (1976), 9–36.CrossRefGoogle Scholar
  4. [4]
    C.N.G. Dampney, M. Johnson and P. Deuble, Taming large complex information systems in D.G. Green and T. Bossomaier (eds) Complex Systems IOS Press, Amsterdam, (1993), 210–222.Google Scholar
  5. [5]
    C.N.G. Dampney, M. Johnson and G.P. Monro, An illustrated mathematical foundation for ERA, in C.M.I. Rattray and R.G. Clarke (eds) The unified computation laboratory, Oxford University Press, Oxford, (1992), 77–84.Google Scholar
  6. [6]
    CA. Gunther, The mixed power domain, to appear in Theoretical Computer Science.Google Scholar
  7. [7]
    Saunders Mac Lane, Categories for the Working Mathematician, Graduate Texts in Mathematics 5, Springer-Verlag, 1971.Google Scholar
  8. [8]
    R. Rosebrugh and R.J. Wood, Relational databases and indexed categories, Canadian Mathematical Society Conference Proceedings13 (1992), 391–407.MathSciNetGoogle Scholar
  9. [9]
    S. Vickers, Geometric theories and databases, London Mathematical Society Lecture Notes177 (1992), 288–314.MathSciNetGoogle Scholar
  10. [10]
    R.F.C. Walters, Categories and computer science, Cambridge University Press, 1992.Google Scholar

Copyright information

© British Computer Society 1994

Authors and Affiliations

  • Michael Johnson
    • 1
  • C. N. G. Dampney
    • 1
  1. 1.School of Mathematics and ComputingMacquarie UniversitySydneyAustralia

Personalised recommendations