Relating multifunctions and predicate transformers through closure operators

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

Volumn 789 LNCS, Issue , 1994, Pages 822-843

  Bonsangue, Marcello M ^a   Kok, Joost N ^b  

^a VU UNIVERSITY AMSTERDAM   (Netherlands)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

SET THEORY; TOPOLOGY;

CLOSURE OPERATORS; FIXED POINTS; LIVENESS; MULTI-FUNCTIONS; PLOTKIN POWER DOMAIN; POWER SET; PREDICATE TRANSFORMERS; STATE-TRANSFORMERS;

COMPUTER SOFTWARE;

EID: 84916530598     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-57887-0_127     Document Type: Conference Paper

References (31)

1. S. Abramsky. Domain Theory and the Logic of Observable Properties. PhD thesis, Queen Mary College, University of London, 1987.
2. K.R. Apt and G. Plotkin. Countable nondeterminism and random assignment. Journal of the ACM, 33(4):724-767, October 1986.
3. C. Berge. Topological Spaces - including a treatment of Multi-valued Functions, Vector Spaces and Convexity. Oliver &: Boyd, 1963. English translation of ‘Espaces Topologiques: Fonctions Multivoques’ published by Dunod, Paris 1959.
4. E. Best. Relational semantic of concurrent programs (with some applications). In D. Bjorner, editor, Proc. of the 1FIP Working Conference on on Formal Description of Programming Concepts - II, pages 431-452, Garmisch-Partenkirchen, FRG, 1983. North-Holland Publishing Company.
5. M.M. Bonsangue, B. Jacobs, and J.N. Kok. Duality beyond sober spaces: Topological spaces and observation frames. Presented at the Workshop on Topology and Completion in Semantics, Chartres, France, 18-20 Nov. ‘93. Available through anonymous ftp from ftp.es.vu.nlas/pub/bonsangue/duality.ps.Z, 1993.
6. M. Bonsangue and J.N. Kok. Semantics, orderings and recursion in the weakest precondition calculus. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Rex Workshop ‘92 ‘Semantics: Foundations and Applications’, number 666 in Lecture Notes in Computer Science, pages 91-109, 1992. Extended version available through anonymous ftp from ftp.cs.vu.nlas/pub/bonsangue/wp.ps.Z.
7. M. Bonsangue and J.N. Kok. Isomorphisms between state and predicate transformers. In A.M. Borzyszkowski and S. Sokolowoski, editors, MFCS ‘93, Gdansk, Poland, number 711 in Lecture Notes in Computer Science, pages 301-310, 1993. Extended version available through anonymous ftp from ftp.cs.vu.nl as/pub/bonsangue/isomorph.ps.Z.
8. E.W. Dijkstra. A Discipline of Programming. Prentice-Hall, 1976.
9. B.A. Davey and H.A. Priestley. Introduction to Lattices and Order. Cambridge University Press, 1990.
10. E.W. Dijkstra and C.S. Scholten. Predicate Calculus and Program Semantics. Springer-Verlag, New York, 1990.
11. J. Dugundji. Topology. Allyn and Bacon, inc., 1966.
12. R. Engelking. General Topology. Polish Scientific Publishers, 1977.
13. G. Gierz, K.H. Hofmann, K. Keimel, J. Lawson, M. Mislove, and D. Scott. A Compendium of Continuous Lattices. Springer-Verlag, 1980.
14. R. Heckmann. Power domains constructions. Science of Computer Programming, 17:77-117, 1991.
15. K. Hoffman and M. Mislove. Local compactness and continuous lattices. In Banaschewski and IIoffman, editors, Continuous lattices – Proceedings Bremen 1979, number 871 in Lecture Notes in Mathematics, pages 209-248, 1981.
16. A. Jung and S. Abramsky. Domain theory. To appear in the Handbook of Logic in Computer Science, vol. III- Semantics Structure, S. Abramsky, D.M. Gabbay and T.S.E. Malbaum ads., 1994.
17. P.T. Johnstone. Scott is not always sober. In Banaschewski and Hoffman, editors, Continuous lattices- Proceedings Bremen 1979, number 871 in Lecture Notes in Mathematics, pages 282-283, 1981.
18. P.T. Johnstone. Stone Spaces. Cambridge University Press, 1982.
19. R. E. Kent. The Metric Closure Powerspace Construction. In Proceedings of the 3th MFPS, 1987, number 298 in Lecture Notes in Computer Science, pages 173-199, 1987.
20. G. Markowsky. Chain-complete posets and directed sets with applications. Algebra Universalis, 6:53-68, 1976.
21. E. Michael. Topologies on a space of subsets. Transactions AMS, 71:152-182, 1951.
22. S.B. Nadler. Hyperspaces of Sets. Pure and Applied Mathematics. Marcel Dekker, 1978.
23. G. Nelson. A generalization of Dijkstra’s calculus. A CM Transaction on Programming Languages and Systems, 11, 4:517-561, 1989.
24. G.D. Plotkin. A powerdomain construction. SIAM J. Comput., 5:452-487, 1976.
25. G.D. Plotkin. Dijkstra’s predicate transformer and Smyth’s powerdomain. In Proceedings of the Winter School on Abstract Software Specification, volume 86 of Lecture Notes in Computer Science, pages 527-553, 1979.
26. G.D. Plotkin. Post-graduate lecture notes in advanced domain theory (incorporating the “Pisa Notes”). Department of Computer Science, Univ. of Edinburgh, 1981.
27. M.B. Smyth. Power domains. J. Comput. Syst. Sci., 16,1:23-36, 1978.
28. M.B. Smyth. Power domains and predicate transformers: A topological view. In Proceedings of ICALP ‘83 (Barcelona), volume 154 of Lecture Notes in Computer Science, pages 662-675, 1983.
29. M.B. Smyth. Topology. In S. Abramsky, D.M. Gabbay, and T.S.E. Malbaum, editors, Handbook of Logic in Computer Science, volume I - Background: Mathematical Structures, pages 641-761. Clarendon Press, 1992.
30. M.B. Smyth and G.D. Plotkin. The category-theoretic solution of recursive domain equations. SIAM J. Comput., 11:761-783, 1982.
31. S.J. Vickers. Topology via Logic, volume 5 of Cambridge Tracts in Theoretical Computer Science. Cambridge University Press, 1989.