Prototyping Relational Specifications Using Higher-Order Objects

An approach is described for the generation of certain mathematical objects (like sets, correspondences, mappings) in terms of relations using relation-algebraic descriptions of higher-order objects. From non-constructive characterizations executable relational specifications are obtained. We also show how to develop more efficient algorithms from the frequently inefficient specifications within the calculus of binary relations.

[1]  Willem P. de Roever,et al.  Recursion and Parameter Mechanisms: An Axiomatic Approach , 1974, ICALP.

[2]  Hans Zierer,et al.  Relation Algebraic Domain Constructions , 1991, Theor. Comput. Sci..

[3]  Robert M. Ha.  The Diclique Representation and Decomposition of Binary Relations , 1974 .

[4]  Andre Scedrov,et al.  Categories, allegories , 1990, North-Holland mathematical library.

[5]  Gunther Schmidt,et al.  Relations and Graphs: Discrete Mathematics for Computer Scientists , 1993 .

[6]  A. Tarski,et al.  Boolean Algebras with Operators. Part I , 1951 .

[7]  Alfred Tarski,et al.  Distributive and Modular Laws in the Arithmetic of Relation Algebras , 1953 .

[8]  W. P. Roever.  Recursion and Parameter Mechanisms: An Axiomatic Approach , 1974, ICALP.

[9]  Roland Carl Backhouse,et al.  A relational theory of datatypes , 1992 .

[10]  Gunther Schmidt,et al.  The RELVIEW-System , 1991, STACS.

[11]  Wolfgang Reisig.  Petri Nets: An Introduction , 1985, EATCS Monographs on Theoretical Computer Science.

[12]  R. Budde,et al.  Approaches to Prototyping , 1984, Springer Berlin Heidelberg.

[13]  Thomas Ströhlein,et al.  On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints , 1985 .

[14]  A. Tarski,et al.  Boolean Algebras with Operators , 1952 .

[15]  C. A. R. Hoare,et al.  The Weakest Prespecification , 1987, Information Processing Letters.

[16]  Gunther Schmidt,et al.  Programs as Partial Graphs I: Flow Equivalence and Correctness , 1981, Theor. Comput. Sci..

[17]  Gunther Schmidt,et al.  Relationen und Graphen , 1989, Mathematik für Informatiker.

[18]  Gunther Schmidt,et al.  Symmetric Quotients and Domain Constructions , 1989, Inf. Process. Lett..

[19]  J. Michael Spivey,et al.  The Z notation - a reference manual , 1992, Prentice Hall International Series in Computer Science.

[20]  Willem P. de Roever,et al.  A Calculus for Recursive Program Schemes , 1972, ICALP.

[21]  Alfred Tarski,et al.  Relational selves as self-affirmational resources , 2008 .

[22]  Rudolf Berghammer,et al.  Relational Algebraic Semantics of Deterministic and Nondeterministic Programs , 1986, Theor. Comput. Sci..

[23]  Tim Brook.  Order and recursion in topoi , 1977 .

[24]  Gunther Schmidt,et al.  An Interactive Graphical Manipulation System for Higher Objects Based on Relational Algebra , 1986 .

[25]  Paulo A. S. Veloso,et al.  A finitary relational algebra for classical first-order logic , 1991 .