Skip to main content
SpringerLink
Log in

Relational Heterogeneity Relaxed by Subtyping

  • Conference paper
Relational and Algebraic Methods in Computer Science (RAMICS 2011)

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

Abstract

Homogeneous relation algebra is an elegant calculational framework with many applications in computing science. In one application of relation algebra, called Ampersand, heterogeneous relation algebra is used as a specification language for business processes and information systems. For this purpose a typed version of relation algebra is needed together with subtyping. This requires heterogeneous relational algebra. However, the partiality of the composition and union operators in heterogeneous relational algebra are detrimental to its manipulative power. This paper proposes a practical solution to this problem. The authors suggest to relax the partiality of the heterogeneous operators. By suitable choices this homogenisation allows for a type-based specification language, which has sufficient manipulative power.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Aarts, C., Backhouse, R., Hoogendijk, P., Voermans, T., van der Woude, J.: A relational theory of datatypes (1992), STOP summer school notes, http://www.cs.nott.ac.uk/~rcb/papers/abstract.html#book

  2. Backhouse, R.: Pair algebras and Galois connections. Information Processing Letters 67(4), 169–176 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  3. Brink, C., Kahl, W., Schmidt, G. (eds.): Relational methods in computer science. Advances in computing. Springer, Heidelberg (1997)

    MATH  Google Scholar 

  4. Freyd, P., Scedrov, A.: Categories, allegories. North-Holland Publishing Co., Amsterdam (1990)

    MATH  Google Scholar 

  5. Maddux, R.: Relation algebras. Elsevier, Amsterdam (2006)

    MATH  Google Scholar 

  6. Riguet, J.: Relations binaires, fermetures, correspondances de Galois. Bull. Soc. Math. France 76, 114–155 (1948)

    Article  MathSciNet  MATH  Google Scholar 

  7. Schmidt, G., Ströhlein, T.: Relationen und Grafen. Springer, Heidelberg (1988)

    Google Scholar 

  8. Michels, G., Joosten, S., van der Woude, J., Joosten, S.: Ampersand: Applying Relation Algebra in Practice. In: de Swart, H. (ed.) RAMICS 2011. LNCS, vol. 6663, pp. 280–293. Springer, Heidelberg (2011)

    Google Scholar 

  9. Tarski, A.: On the calculus of relations. Journal of Symbolic Logic 6(3), 73–89 (1941)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Open Universiteit Nederland, Postbus 2960, 6401 DL, HEERLEN, The Netherlands

    Jaap van der Woude & Stef Joosten

  2. Ordina NV, Nieuwegein, The Netherlands

    Stef Joosten

Authors
  1. Jaap van der Woude
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stef Joosten
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Philosophy, Tilburg University, P.O. Box 90153, 5000, Tilburg, LE, The Netherlands

    Harrie de Swart

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

van der Woude, J., Joosten, S. (2011). Relational Heterogeneity Relaxed by Subtyping. In: de Swart, H. (eds) Relational and Algebraic Methods in Computer Science. RAMICS 2011. Lecture Notes in Computer Science, vol 6663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21070-9_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-21070-9_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-21069-3

  • Online ISBN: 978-3-642-21070-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation