Partializing stone spaces using SFP domains

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

Volumn 1214, Issue , 1997, Pages 478-489

  Alessi, F ^a   Baldan, P ^a   Honsell, F ^a  

^a UNIVERSITY OF UDINE   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRA;

DOMAIN EQUATIONS; EMBEDDING-PROJECTION PAIRS; FUNCTORS; MAXIMAL ELEMENTS; PLOTKIN POWERDOMAIN; STONE SPACES; TWO DOMAINS;

SOFTWARE DESIGN;

EID: 21744439868     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0030620     Document Type: Conference Paper

References (19)

1. Samson Abramsky. Total vs. partial object and fixed points of functors. Unpublished Manuscript, 1985.
2. Samson Abramsky. A Cook’s tour of the finitary non-well-founded sets. Talk delivered at BTCS Colloquium, 1988.
3. Samson Abramsky. A domain equation for bisimulation. Information and Computation, 92(2):161-218, 1991.
4. Samson Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1-77i 1991.
5. F. Alessi, P. Baldan and F. Honsell. Partializing Stone Spaces using SFP domains. Technical Report. University of Udine.
6. F. Alessi and M. Lenisa. Stone duality for trees of balls. Talk delivered at MASK workshop, Koblenz, 1993.
7. P. Baldan. A fixed point theorem for the solution of domain equations in a category of trees. Tesi di Laurea, Udine 1994.
8. J.W. de Bakker and E. de Vink. Control Flow Semantics. MIT Press, 1996.
9. J.W. de Bakker and J.I. Zucker. Processes and the denotational semantics of concurrency. Information and Control, 54(12):70-120, 1982.
10. P. Di Gianantonio. Real number computability and domain theory. Information and Computation, 127(1):11-25, 1996.
11. J. Dugundji. Topology. Allyn and Bacon, 1966.
12. A. Edalat and R. Heckmann. A computational model for metric spaces. 1996, to appear.
13. M. Forti, F. Honsell, and M. Lenisa. Processes and hyperuniverses. MFCS ‘93, LNCS 841:352-367, 1994.
14. M.E. Majster-Cederbaum and F. Zetzsche. Towards a foundations for semantics in complete metric spaces. Information and Computation, 90:217-243, 1991.
15. M.W. Mislove, L.S. Moss, and F.J. Oles. Non-well-founded sets modeled as ideal fixed points. Information and Computation, 93(1):16-54, 1991.
16. Gordon D., Plotkin A. Powerdomain construction. SIAM Journal on Computing, 5(3):452-487, 1976.
17. Gordon D., Plotkin. Domains. Unpublished Course Notes. University of Edinburgh, 1983.
18. Marshall H. Stone. The theory of representations for Boolean algebras. Transactions of the American Mathematical Society, 40:37-111, 1936.
19. K Weihrauch and U. Shreiber. Embedding metric spaces into cpo’s. Theoretical Computer Science, 16(1):5-24, 1981.