Continuous domains in logical form

Electronic Notes in Theoretical Computer Science

Volumn 49, Issue , 2002, Pages 1-166

  Kegelmann, Mathias ^a  

^a DARMSTADT UNIVERSITY OF TECHNOLOGY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; COMPUTER SCIENCE; SEMANTICS; SYNTACTICS; THEOREM PROVING; TOPOLOGY;

ABRAMSKY'S DOMAIN THEORY; CONTINUOUS DOMAINS; LOGICAL FORMS; MULTI-LINGUAL SEQUENT CALCULUS;

LOGIC PROGRAMMING;

EID: 19044366688     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00332-9     Document Type: Article

References (66)

1. Abramsky S., "Domain Theory and the Logic of Observable Properties," Ph.D. thesis, University of London (1987).
2. Abramsky S. The lazy lambda calculus. Turner D. Research Topics in Functional Programming. 1990;65-117 Addison Wesley
3. Abramsky S. A domain equation for bisimulation. Information and Computation. 92:1991;161-218
4. Abramsky S. Domain theory in logical form. Annals of Pure and Applied Logic. 51:1991;1-77
5. Abramsky S., Jung A. Domain theory. Abramsky S., Gabbay D.M., Maibaum T.S.E. Semantic Structures, Handbook of Logic in Computer Science 3. 1994;1-168 Clarendon Press
6. Birkhoff G. Lattice Theory. AMS Colloq. Publ. 25. third edition :1967;American Mathematical Society, Providence
7. Bonsangue M., "Topological Dualities in Semantics," Ph.D. thesis, Vrije Universiteit Amsterdam (1996), 258pp.
8. Bourbaki N. General Topology-Chapters 1-4. Elements of Mathematics. 1988;Springer Verlag
9. Davey B.A., Priestley H.A. Introduction to Lattices and Order. 1990;Cambridge University Press, Cambridge
10. Dijkstra E.W. A Discipline of Programming. 1976;Prentice-Hall, Englewood Cliffs, New Jersey
11. Edalat A., Domain theory and integration, in: Ninth Annual IEEE Symposium on Logic in Computer Science (1994), pp. 115-124.
12. Edalat A. Dynamical systems, measures and fractals via domain theory. Information and Computation. 120:1995;32-48
13. Edalat A. and M. H. Escardó, Integration in real PCF (1996), to appear in LICS'96.
14. Edalat A. and R. Heckmann, Computational models for metric spaces (1995), manuscript.
15. Escardó M.H. PCF extended with real numbers. Theoretical Computer Science. 162:1996;79-115
16. Escardó M.H. Properly injective spaces and function spaces. Topology and Its Applications. 89:1998;75-120
17. Freyd P.J., Scedrov A. Categories, Allegories. 1990;North-Holland
18. Gentzen G. Untersuchungen über das logische Schließen. Mathematische Zeitschrift. 39:1934;176-210. 405-431, (Reprint 1969, Wissenschaftliche Buchgesellschaft Darmstadt).
19. Gierz G., Hofmann K.H., Keimel K., Lawson J.D., Mislove M., Scott D.S. A Compendium of Continuous Lattices. 1980;Springer Verlag
20. Gierz G., Lawson J.D., Stralka A. Quasicontinuous posets. Houston Journal of Mathematics. 9:1983;191-208
21. Hoare C.A.R. An axiomatic basis for computer programming. Communications of the ACM. 12:1969;576-580
22. Hoffmann R.-E. Continuous posets, prime spectra of completely distributive complete lattices, and Hausdorff compactification. Banaschewski B., Hoffmann R.-E. Continuous Lattices, roceedings Bremen 1979, Lecture Notes in Mathematics 871. 1981;159-208
23. Hofmann K.H., Mislove M. Local compactness and continuous lattices. Banaschewski B., Hoffmann R.-E. Continuous Lattices, Proceedings Bremen 1979, Lecture Notes in Mathematics 871. 1981;209-248 Springer Verlag
24. Johnstone P.T. Scott is not always sober. Banaschewski B., Hoffmann R.-E. Continuous Lattices, Proceedings Bremen 1979, Lecture Notes in Mathematics 871. 1981;282-283
25. Johnstone P.T. Stone Spaces. Cambridge Studies in Advanced Mathematics 3. 1982;Cambridge University Press, Cambridge
26. Johnstone P.T. The point of pointless topology. Bulletin of the American Mathematical Society. 8:1983;41-53
27. Jones C., "Probabilistic Non-Determinism," Ph.D. thesis, University of Edinburgh, Edinburgh (1990), also published as Technical Report No. CST 63-90.
28. Jones C., Plotkin G. A probabilistic powerdomain of evaluations. Logic in Computer Science. 1989;186-195
29. Jung A., "Cartesian Closed Categories of Domains," CWI Tracts 66, Centrum voor Wiskunde en Informatica, Amsterdam, 1989, 107 pp.
30. Jung A., The classification of continuous domains, in: Proceedings, Fifth Annual IEEE Symposium on Logic in Computer Science (1990), pp. 35-40.
31. Jung A., M. Kegelmann and M. A. Moshier, Multi lingual sequent calculus and coherent spaces, in: S. Brookes and M. Mislove, editors, 13th Conference on Mathematical Foundations of Programming Semantics, Electronic Notes in Theoretical Computer Science 6 (1997), 18 pages.
32. Jung A., Kegelmann M., Moshier M.A. Multi lingual sequent calculus and coherent spaces. Fundamenta Informaticae. 37:1999;369-412
33. Jung A., and P. Sünderhauf, On the duality of compact vs. open, in: S. Andima, R. C. Flagg, G. Itzkowitz, P. Misra, Y. Kong and R. Kopperman, editors, Papers on General Topology and Applications: Eleventh Summer Conference at the University of Southern Maine, Annals of the New York Academy of Sciences 806, 1996, pp. 214-230.
34. Jung A., Sünderhauf P. Uniform approximation of topological spaces. Topology and its Applications. 83:1998;23-38
35. Jung A. and R. Tix, The troublesome probabilistic powerdomain, in: A. Edalat, A. Jung, K. Keimel and M. Kwiatkowska, editors, Proceedings of the Third Workshop on Computation and Approximation, Electronic Notes in Theoretical Computer Science 13 (1998), 23 pages.
36. Keimel K. and J. Paseka, A direct proof of the Hofmann-Mislove theore, Proceedings of the AMS 120 (1994), pp. 301-303.
37. Keimel K. and R. Tix, Valuations and measures (1996), unpublished manuscript.
38. Kelley J.L. General Topology. Graduate Texts in Mathematics 27. 1975;Springer Verlag
39. Kopperman R., The skew fields of topology (1994), preprint.
40. Lambek J., Scott P.J. Introduction to Higher Order Categorical Logic. Cambridge Studies in Advanced Mathematics 7. 1986;Cambridge University Press
41. Lawson J.D. The duality of continuous posets. Houston Journal of Mathematics. 5:1979;357-394
42. Lawson J.D. The versatile continuous order. Main M., Melton A., Mislove M., Schmidt D. Mathematical Foundations of Programming Language Semantics, Lecture Notes in Computer Science 298. 1988;134-160
43. Lawson J.D. Order and strongly sober compactification. Reed G.M., Roscoe A.W., Wachter R.F. Topology and Category Theory in Computer Science. 1991;179-205 Clarendon Press
44. Lawson J.D. Spaces of maximal points. Mathematical Structures in Computer Science. 7:1997;543-555
45. Mac Lane S. Categories for the Working Mathematician. Graduate Texts in Mathematics 5. 1971;Springer Verlag
46. McLarty C. Elementary Categories, Elementary Toposes. Oxford Logic Guides 21. 1992;Oxford University Press
47. Meinke K., Tucker J.V. Universal algebra. Abramsky S., Gabbay D.M., Maibaum T.S.E. Background: Mathematical Structures, Handbook of Logic in Computer Science 1. 1992;Clarendon Press
48. Nachbin L., Sur les espaces uniformes ordonnés, C. R. Acad. Sci MR 9, 455 (1948), pp. 774-775, english translation in [49].
49. Nachbin L., "Topology and Order," Von Nostrand, Princeton, N.J., 1965, reprinted by Robert E. Kreiger Publishing Co., Huntington, NY, 1967.
50. Plotkin G.D. A powerdomain construction. SIAM Journal on Computing. 5:1976;452-487
51. Plotkin, G. D., Post-graduate lecture notes in advanced domain theory (incorporating the "Pisa Notes") (1981), dept. of Computer Science, Univ. of Edinburgh.
52. Raney, G. N., A subdirect-union representation for completely distributive complete lattices, Proceedings of the AMS 4 (1953), pp. 518-522.
53. Rewitzky I. and C. Brink, Unification of four versions of program semantics, Research Reports RR 10/96, The University of Cape Town (1996).
54. Schalk A., "Algebras for Generalized Power Constructions," Doctoral thesis, Technische Hochschule Darmstadt (1993), 174 pp.
55. Scott, D. S., Outline of a mathematical theory of computation, in: 4th Annual Princeton Conference on Information Sciences and Systems, 1970, pp. 169-176.
56. Scott D.S. Data types as lattices. SIAM J. Computing. 5:1976;522-587
57. Scott D.S. Relating theories of lambda calculus. Hindley J.R., Seldin J.P. To H. B. Curry: Essays in Combinatory Logic, Lambda Calculus and Formalism. 1980;403-450 Academic Press
58. Smyth M.B. The largest cartesian closed category of domains. Theoretical Computer Science. 27:1983;109-119
59. Smyth M.B. Powerdomains and predicate transformers: a topological view. Diaz J. Automata, Languages and Programming, Lecture Notes in Computer Science 154. 1983;662-675
60. Smyth M.B. Stable compactification I. Journal of the London Mathematical Society. 45:1992;321-340
61. Smyth M.B. Topology. Abramsky S., Gabbay D.M., Maibaum T.S.E. Handbook of Logic in Computer Science, vol. 1. 1992;641-761 Clarendon Press
62. Smythe N., Wilkins C.A. Minimal Hausdorff and maximal compact spaces. Journal of the Australian Mathematical Society. 3:1963;167-171
63. Stone M.H. The theory of representations for Boolean algebras. Trans. American Math. Soc. 40:1936;37-111
64. Sünderhauf P., "Discrete Approximation of Spaces," Ph.D. thesis, Technische Hochschule Darmstadt (1994), 91 pp.
65. Vickers S.J. Topology Via Logic. Cambridge Tracts in Theoretical Computer Science 5. 1989;Cambridge University Press
66. G.-Q. Zhang, "Logic of Domains," Progress in Theoretical Computer Science, Birkhäuser, 1991.