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, 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Brink, C., Schmidt, R.A.: Subsumption computed algebraically. Computers and Mathematics with Applications 23(2-5), 329–342 (1992)
Brink, C., Kahl, W., Schmidt, G. (eds.): Relational methods in computer science. Advances in Computing. Springer, New York (1997)
Codd, E.F.: A relational model of data for large shared data banks. Communications of the ACM 13(6), 377–387 (1970)
Date, C.J.: What not how: the business rules approach to application development. Addison-Wesley Longman Publishing Co., Inc., Boston (2000)
Desharnais, J.: Basics of relation algebra, http://www2.ift.ulaval.ca/~Desharnais/Recherche/Tutoriels/TutorielRelMiCS10.pdf
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)
Hattensperger, C., Kempf, P.: Towards a formal framework for heterogeneous relation algebra. Inf. Sci. 119(3-4), 193–203 (1999)
Jackson, D.: A comparison of object modelling notations: Alloy, UML and Z. Tech. rep. (1999), http://sdg.lcs.mit.edu/publications.html
Jackson, D.: Software Abstractions: Logic, Language, and Analysis. The MIT Press, Cambridge (2006)
Maddux, R.D.: Relation Algebras. Studies in logic, vol. 150. Elsevier, Iowa (2006)
Peyton Jones, S. (ed.): Haskell 98 Language and Libraries – The Revised Report. Cambridge University Press, Cambridge (2003)
Sanderson, J.G.: A Relational Theory of Computing. LNCS, vol. 82. Springer, New York (1980)
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)
Spivey, J.M.: The Z Notation: A reference manual, 2nd edn. International Series in Computer Science. Prentice Hall, New York (1992)
van der Woude, J., Joosten, S.: Relational heterogeneity relaxed by subtyping, (submitted 2011)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Michels, G., Joosten, S., van der Woude, J., Joosten, S. (2011). Ampersand. 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_21
Download citation
DOI: https://doi.org/10.1007/978-3-642-21070-9_21
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)