JUCS - Journal of Universal Computer Science 7(2): 107-123, doi: 10.3217/jucs-007-02-0107
Modeling Sequences within the RelView System
expand article infoRudolf Berghammer‡, Thorsten Hoffmann§
‡ University of Kiel, Kiel, Germany§ Christian-Albrechts-Universität Kiel, Kiel, Germany

Corresponding author: Rudolf Berghammer ( rub@informatik.uni-kiel.de )

© Rudolf Berghammer, Thorsten Hoffmann.
This article is freely available under the J.UCS Open Content License.
Citation: Berghammer R, Hoffmann T (2001) Modeling Sequences within the RelView System. JUCS - Journal of Universal Computer Science 7(2): 107-123. https://doi.org/10.3217/jucs-007-02-0107
Open Access
Abstract
We use a relational characterization of binary direct sums to model sequences within the relation-algebraic manipulation and prototyping system RelView in a simple way. As an application we formally derive a RelView program for computing equivalence classes of an equivalence relation, where we combine relation-algebraic calculations with the so-called Dijkstra-Gries program development method. Also a refinement of the simple modeling is presented, which leads to the classical datatype of stacks, and a further application is sketched.
Keywords
relational algebra, relational modelling and programming, formal program derivation, equivalence classes, RelView system