The algebra of multirelations

Multirelational semantics are well suited to reasoning about programs involving two kinds of non-determinism. This paper lays the categorical foundations for an algebraic calculus of multirelations.

[1]  Joseph M. Morris,et al.  Dually nondeterministic functions , 2008, TOPL.

[2]  P. Johnstone.  Sketches of an Elephant: A Topos Theory Compendium Volume 1 , 2002 .

[3]  Michael Barr,et al.  Category theory for computing science , 1995, Prentice Hall International Series in Computer Science.

[4]  Ivo Düntsch,et al.  Structures with Multirelations, their Discrete Dualities and Applications , 2010, Fundam. Informaticae.

[5]  Joseph M. Morris,et al.  Modelling higher-order dual nondeterminacy , 2008, Acta Informatica.

[6]  Ingrid Rewitzky,et al.  Binary Multirelations , 2003, Theory and Applications of Relational Structures as Knowledge Instruments.

[7]  Samson Abramsky,et al.  Domain Theory in Logical Form , 1991, LICS.

[8]  C. A. R. HOARE,et al.  An axiomatic basis for computer programming , 1969, CACM.

[9]  Clare E. Martin,et al.  Modelling angelic and demonic nondeterminism with multirelations , 2007, Sci. Comput. Program..

[10]  Clare E. Martin,et al.  Nondeterministic Folds , 2006, MPC.

[11]  Robert W. Floyd,et al.  Assigning Meanings to Programs , 1993 .

[12]  Roger D. Maddux,et al.  Relation-Algebraic Semantics , 1996, Theor. Comput. Sci..

[13]  David A. Naumann,et al.  Ideal models for pointwise relational and state-free imperative programming , 2001, PPDP '01.

[14]  Clare E. Martin,et al.  An Algebraic Construction of Predicate Transformers , 1992, MPC.

[15]  Carroll Morgan,et al.  The Refinement Calculus , 1994, NATO ASI PDC.

[16]  David A. Naumann,et al.  A categorical model for higher order imperative programming , 1998, Mathematical Structures in Computer Science.

[17]  Carroll Morgan,et al.  Programming from specifications , 1990, Prentice Hall International Series in computer science.

[18]  M. Stone.  The theory of representations for Boolean algebras , 1936 .

[19]  Ralph-Johan Back,et al.  Combining Angles, Demons and Miracles in Program Specifications , 1992, Theor. Comput. Sci..

[20]  Michael B. Smyth,et al.  Power Domains and Predicate Transformers: A Topological View , 1983, ICALP.

[21]  Clare E. Martin,et al.  Monadic Maps and Folds for Multirelations in an Allegory , 2008, UTP.

[22]  Richard S. Bird,et al.  Algebra of programming , 1997, Prentice Hall International series in computer science.

[23]  Edsger W. Dijkstra,et al.  Guarded commands, nondeterminacy and formal derivation of programs , 1975, Commun. ACM.

[24]  Carroll Morgan,et al.  Programming from specifications (2nd ed.) , 1994 .

[25]  Maarten M. Fokkinga.  Monadic Maps and Folds for Arbitrary Datatypes , 1994 .

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

[27]  Ralph-Johan Back,et al.  Refinement Calculus: A Systematic Introduction , 1998 .

[28]  A. D. Morgan.  On the Symbols of Logic, the Theory of the Syllogism, and in particular of the Copula, and the application of the Theory of Probabilities to some questions of Evidence , 1851 .

[29]  Joseph M. Morris,et al.  A Theoretical Basis for Stepwise Refinement and the Programming Calculus , 1987, Sci. Comput. Program..

[30]  Brian A. Davey,et al.  An Introduction to Lattices and Order , 1989 .

[31]  Clare E. Martin.  Towards a Calculus of Predicate Transformers , 1995, MFCS.