Relational heterogeneity relaxed by subtyping

J.C.S.P. Woude, van der, S.M.M. Joosten

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

3 Citations (Scopus)

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.
Original languageEnglish
Title of host publicationRelational and Algebraic Methods in Computer Science (12th International Conference, RAMICS 2011, Rotterdam, The Netherlands, May 30–June 3, 2011. Proceedings)
EditorsH. Swart, de
Place of PublicationBerlin
PublisherSpringer
Pages347-361
ISBN (Print)978-3-642-21069-3
DOIs
Publication statusPublished - 2011

Publication series

NameLecture Notes in Computer Science
Volume6663
ISSN (Print)0302-9743

    Fingerprint

Cite this

Woude, van der, J. C. S. P., & Joosten, S. M. M. (2011). Relational heterogeneity relaxed by subtyping. In H. Swart, de (Ed.), Relational and Algebraic Methods in Computer Science (12th International Conference, RAMICS 2011, Rotterdam, The Netherlands, May 30–June 3, 2011. Proceedings) (pp. 347-361). (Lecture Notes in Computer Science; Vol. 6663). Berlin: Springer. https://doi.org/10.1007/978-3-642-21070-9_25