More Web Proxy on the site http://driver.im/

Article

Ampersand applying relation algebra in practice

Authors:

Gerard Michels,

Sebastiaan Joosten,

Jaap van der Woude,

Stef JoostenAuthors Info & Claims

RAMICS'11: Proceedings of the 12th international conference on Relational and algebraic methods in computer science

Pages 280 - 293

Published: 30 May 2011 Publication History

Abstract

Relation algebra can be used to specify information systems and business processes. It was used in practice in two large IT projects in the Dutch government. But which are the features that make relation algebra practical? This paper discusses these features and motivates them from an information system designer's point of view. The resulting language, Ampersand 1, is a syntactically sugared version of relation algebra. It is a typed language, which is supported by a compiler. The design approach, also called Ampersand, uses software tools that compile Ampersand scripts into functional specifications. This makes Ampersand interesting as an application of relation algebra in the industrial practice. The purpose of this paper is to define Ampersand and motivate its features from a practical perspective.

This work is part of the research programme of the Information Systems & Business Processes (IS&BP) department of the Open University.

References

[1]

Brink, C., Schmidt, R.A.: Subsumption computed algebraically. Computers and Mathematics with Applications 23(2-5), 329-342 (1992)

[2]

Brink, C., Kahl, W., Schmidt, G. (eds.): Relational methods in computer science. Advances in Computing. Springer, New York (1997)

Digital Library

[3]

Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM 13(6), 377-387 (1970)

Digital Library

[4]

Date, C.J.: What not how: the business rules approach to application development. Addison-Wesley Longman Publishing Co., Inc., Boston (2000)

Digital Library

[5]

Desharnais, J.: Basics of relation algebra, http://www2.ift.ulaval.ca/ ~Desharnais/Recherche/Tutoriels/TutorielRelMiCS10.pdf

[6]

Dijkstra, A., Swierstra, S.D.: Typing haskell with an attribute grammar. In: Vene, V., Uustalu, T. (eds.) AFP 2004. LNCS, vol. 3622, pp. 1-72. Springer, Heidelberg (2005)

Digital Library

[7]

Hattensperger, C., Kempf, P.: Towards a formal framework for heterogeneous relation algebra. Inf. Sci. 119(3-4), 193-203 (1999)

Digital Library

[8]

Jackson, D.: A comparison of object modelling notations: Alloy, UML and Z. Tech. rep. (1999), http://sdg.lcs.mit.edu/publications.html

[9]

Jackson, D.: Software Abstractions: Logic, Language, and Analysis. The MIT Press, Cambridge (2006)

Digital Library

[10]

Maddux, R.D.: Relation Algebras. Studies in logic, vol. 150. Elsevier, Iowa (2006)

[11]

Peyton Jones, S. (ed.): Haskell 98 Language and Libraries - The Revised Report. Cambridge University Press, Cambridge (2003)

[12]

Sanderson, J.G.: A Relational Theory of Computing. LNCS, vol. 82. Springer, New York (1980)

Digital Library

[13]

Schmidt, G., Hattensperger, C., Winter, M.: Heterogeneous Relation Algebra. In: Relational Methods in Computer Science. Advances in Computing, ch. 3, pp. 39-53. Springer, New York (1997)

Digital Library

[14]

Spivey, J.M.: The Z Notation: A reference manual, 2nd edn. International Series in Computer Science. Prentice Hall, New York (1992)

Digital Library

[15]

van der Woude, J., Joosten, S.: Relational heterogeneity relaxed by subtyping, (submitted 2011)

Cited By

Tarenskeen D(2016)Conceptual Independence as an Architecture Pattern for Adaptable SystemsProceedings of the 10th Travelling Conference on Pattern Languages of Programs10.1145/3022636.3022641(1-10)Online publication date: 7-Apr-2016
https://dl.acm.org/doi/10.1145/3022636.3022641
Wedemeijer L(2013)An essential language for declarative business rulesProceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research10.5555/2541917.2541922(59-65)Online publication date: 4-Apr-2013
https://dl.acm.org/doi/10.5555/2541917.2541922
Michels GJoosten S(2013)Progressive Development and Teaching with RAPProceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research10.5555/2541917.2541920(33-43)Online publication date: 4-Apr-2013
https://dl.acm.org/doi/10.5555/2541917.2541920
Show More Cited By

Recommendations

The clone relation of a binary relation

In a recent paper, De Baets etal. introduced the clone relation of a strict order relation. Two elements of a poset are said to be a pair of clones (or to be clones) if every other element that is greater (resp. smaller) than one of them is also greater ...
Applying relation algebra and RelView to solve problems on orders and lattices

Relation algebra is well suited for dealing with many problems on ordered sets. Introducing lattices via order relations, this suggests to apply it and tools for its mechanization for lattice-theoretical problems, too. We combine relation algebra and ...
Approximation Operators, Binary Relation and Basis Algebra in L-fuzzy Rough Sets
Knowledge Technology

Approximation operators play a vital role in rough set theory. Their three elements, namely, binary relation in the universe, basis algebra and properties, are fundamental in the study of approximation operators. In this paper, the interrelations among ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Guide Proceedings

RAMICS'11: Proceedings of the 12th international conference on Relational and algebraic methods in computer science

May 2011

361 pages

ISBN:9783642210693

Editor:
Harrie de Swart
Erasmus University Rotterdam, Faculty of Philosophy, Rotterdam, The Netherlands

Sponsors

Erasmus University: Erasmus University
ESF: European Science Foundation
ERASMUS TRUST FUND: Erasmus Trust Fund

Publisher

Springer-Verlag

Berlin, Heidelberg

Publication History

Published: 30 May 2011

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 24 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

Tarenskeen D(2016)Conceptual Independence as an Architecture Pattern for Adaptable SystemsProceedings of the 10th Travelling Conference on Pattern Languages of Programs10.1145/3022636.3022641(1-10)Online publication date: 7-Apr-2016
https://dl.acm.org/doi/10.1145/3022636.3022641
Wedemeijer L(2013)An essential language for declarative business rulesProceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research10.5555/2541917.2541922(59-65)Online publication date: 4-Apr-2013
https://dl.acm.org/doi/10.5555/2541917.2541922
Michels GJoosten S(2013)Progressive Development and Teaching with RAPProceedings of the 3rd Computer Science Education Research Conference on Computer Science Education Research10.5555/2541917.2541920(33-43)Online publication date: 4-Apr-2013
https://dl.acm.org/doi/10.5555/2541917.2541920
van der Woude JJoosten S(2011)Relational heterogeneity relaxed by subtypingProceedings of the 12th international conference on Relational and algebraic methods in computer science10.5555/2018285.2018310(347-361)Online publication date: 30-May-2011
https://dl.acm.org/doi/10.5555/2018285.2018310

View Options

View options

Media

Figures

Other

Tables

View Table of Contents