Binary multirelations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2929, Issue , 2004, Pages 256-271

  Rewitzky, Ingrid ^a  

^a UNIVERSITY OF CAPE TOWN   (South Africa)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 35248831759     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Article

References (24)

1. Back, R.J.R. and J. von Wright. [1989]. Refinement Calculus, part 1: Sequential Programs. In: Rex Workshop for Refinement of Distributed Systems, Nijmegen, The Netherlands. Lecture Notes in Computer Science 430.
2. Back, R.J.R. and J. von Wright. [1992]. Combining angels, demons and miracles in program specifications. Theoretical Computer Science 100. p 365-383.
3. Back, R.J.R. and J. von Wright. [1995]. Games and winning strategies. Information Processing Letters 53 (3). p 165-172.
4. Back, R.J.R. and J. von Wright. [1998]. Refinement Calclulus: A Systematic Introduction. Graduate Texts in Computer Science. New York: Springer-Verlag.
5. Bell, J.L. and A.R. Slomson. [1971]. Models and Ultraproducts. 2nd Edition. Amsterdam: North-Holland.
6. Brink, C. [1993]. Power structures. Algebra Universalis 30. p 177-216.
7. Brink, C. and I. Rewitzky. [2001] A Paradigm for Program Semantics: Power Sructures and Duality. Stanford: CSLI Publications.
8. Davey, B.A. [1979]. On the lattice of subvarieties. Houston Journal of Mathematics 5 (2). p 183-192.
9. Davey, B.A. and H.A. Priestley. [1990]. Introduction to Lattices and Order. Cambridge: Cambridge University Press.
10. Dijkstra, E.W. [1975]. Guarded commands, nondeterminacy and formal derivation of programs. Communications of the ACM 18 (8). p 453-458.
11. _. [1976]. A Discipline of Programming. Englewood Cliffs, New Jersey: Prentice-Hall.
12. Gardiner, P.H. and C.C. Morgan. [1991]. Data refinement of predicate transformers. Theoretical Computer Science 87 (1). p 143-162.
13. Gardiner, P.H., C.E. Martin and O. de Moor. [1994]. An algebraic construction of predicate transformers. Science of Computer Programming 22 (1-2). p 21-44.
14. Gautam, N.D. [1957]. The validity of equations of complex algebra. Archiv für Mathematische Logik und Grundlagenforschung 3. p 117-124.
15. Gierz, G., K.H. Hofman, K. Keimel, J.D. Lawson, M. Mislove and D.S. Scott. [1980]. A Compendium of Continuous Lattices. Berlin: Springer-Verlag.
16. Hesselink, W.H. [1994]. Nondeterminism and recursion via stacks and games. Theoretical Computer Science 124. p 273-295.
17. Hoare, C.A.R. [1996]. An algebra of games of choice. Unpublished manuscript, 4 pages.
18. Jónsson, B. and A. Tarski. [1951]. Boolean algebras with operators I. American Journal of Mathematics 73. p 891-939.
19. _. [1952]. Boolean algebras with operators II. American Journal of Mathematics 74. p 127-167.
20. Morgan, C.C. [1988]. The specification statement. ACM Transactions of Programming Language Systems 10 (3). p 403-491.
21. Morgan, C.C. and K.A. Robertson. [1987]. Specification statements and refinement. IBM Journal of Research and Development 31 (5).
22. Nelson, G. [1989]. A generalisation of Dijkstra's calculus. ACM Transactions on Programming Languages and Systems 11 (4). p 517-562.
23. Rewitzky, I. and C. Brink. [1995]. Predicate transformers as power operations. Formal Aspects of Computing 7. p 169-182.
24. Stone, M.H. [1937]. Topological representations of distributive lattices and Brouwerian logics. Casopis Pro Potování Mathematiky 67. p 1-25.