Synthetic topology of data types and classical spaces

Electronic Notes in Theoretical Computer Science

Volumn 87, Issue , 2004, Pages 21-156

  Escardó, Martín ^a  

^a NONE

Author keywords

Computability; Data types; Denotational semantics; Domain theory; Equilogical spaces; Functional programming; Operational semantics; Programming language semantics; Recursion theory; Scott model of PCF; Synthetic topology; Topological spaces; calculus

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; COMPUTER PROGRAMMING LANGUAGES; COMPUTER SCIENCE; DATA STRUCTURES; SEMANTICS; SET THEORY; THEOREM PROVING;

CARTESIAN CLOSED EXTENSIONS; COMPUTABILITY RECURSION THEORY; DATA TYPES; DOMAIN THEORY; FUNCTIONAL PROGRAMMING; OPERATIONAL SEMANTICS; PROGRAMMING LANGUAGE SEMANTICS; SYNTHETIC TOPOLOGY; TOPOLOGICAL SPACES; ΛCALCULUS;

TOPOLOGY;

EID: 23844479323     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2004.09.017     Document Type: Conference Paper

References (145)

1. Abramsky, S., Domain theory in logical form, Ann. Pure Appl. Logic 51 (1991), pp. 1-77.
2. Abramsky. S., R. Jagadeesan and P. Malacaria, Full abstraction for PCF, Inform, and Comput. 163 (2000), pp. 409-470.
3. Abramsky, S. and A. Jung, Domain theory, in: S. Abramsky, D. Gabbay and T. Maibaum, editors, Handbook of Logic in Computer Science, Oxford science publications 3, Clarendon Press, Oxford, 1994 pp. 1-168.
4. Amadio, R. and P.-L. Curien, "Domains and Lambda-Calculi," CUP, 1998.
5. Awodey, S., L. Birkedal and D. Scott, Local readability toposes and a modal logic for computability, Math. Struct. Comput. Sci. 12 (2002), pp. 319-334.
6. Bauer, A., A relationship between equilogical spaces and type two effectivity, MLQ Math. Log. Q. 48 (2002), pp. 1-15.
7. Bauer, A., Equilogical spaces as imaginary spaces (2003), university of Ljubljana. Presented at the Workshop on Domains, Topology and Constructive Logic, LMU, Department of Mathematics, University of Munich, 1-2 November 2003.
8. Bauer, A. and L. Birkedal, Continuous functionals of dependent types and equilogical spaces, Lec. Not. Comput. Sci. 1862 (2000), pp. 202-216.
9. Bauer, A., L. Birkedal and D. Scott, Equilogical spaces, Theoret. Comput. Sci.
10. Bauer, A., M. Escardó and A. Simpson, Comparing functional paradigms for exact real-number computation, Lect. Not. Comp. Sci. 2380, 2002, pp. 488-500.
11. Bauer, A. and D. Scott, A new category for semantics (2001), notes from D.S. Scott's talk at MFCS 2001. CMU, available from Scott's web page.
12. Beeson, M., "Foundations of Constructive Mathematics," Springer, New York, 1985.
13. Berger, U., "Totale Objekte und Mengen in der Bereichstheorie, " Ph.D. thesis, Mathematisches Institut der Universität München (1990).
14. Berger, U., Total sets and objects in domain theory, Ann. Pure Appl. Logic 60 (1993), pp. 91-117.
15. Berger, U. and P. Oliva, Modified bar recursion and classical dependent choice (to appear).
16. Bird, R. and P. Wadler, "Introduction to Functional Programming," Prentice-Hall, New York, 1988.
17. Bourbaki, N., "General Topology," Addison-Wesley, London, 1966.
18. Brattka, V., Computability over topological structures, in: S. Cooper and S. Goncharov, editors, Computability and Models, Kluwer Academic, 2003 pp. 93-136.
19. Brattka, V. and P. Hertling, Topological properties of real number representations, Theoret. Comput. Sci. 284 (2002), pp. 241-257.
20. Brouwer, L., Besitzt jede reelle Zahl eine Dezimalbruchentwicklung?, Math. Ann. 83 (1920), pp. 201-210.
21. Brown, R., "Topology," Ellis Horwood Ltd., Chichester, 1988, second edition.
22. Coquand, T., S. Sadocco, G. Sambin and J. Smith, Formal topologies on the set of first-order formulae, J. Symbolic Logic 65 (2000), pp. 1183-1192.
23. Croie, R., "Categories for Types," Cambridge University Press, Cambridge, 1993.
24. Davey, B. A. and H. A. Priestley, "Introduction to lattices and order," Cambridge University Press, New York, 2002, second edition, xii+298 pp.
25. Day, B. J. and G. M. Kelly, On topological quotient maps preserved by pullbacks or products, Proc. Cambridge Philos. Soc. 67 (1970), pp. 553-558.
26. DeJaeger, F., An approach to effective. functionals on the real numbers via filter spaces, Topology Proceedings 26 (2001-2002), pp. 485-504.
27. DeJaeger, F., M. Escardó and G. Santini, On the computational content of the Lawson topology, presented at MFPS XVI, available at Escardó's web page.
28. Di Gianantonio, P., Real number computability and domain theory, Inform, and Comput. 127 (1996), pp. 11-25.
29. Dubuc, E., Concrete quasitopoi, Lect. Notes Math. 753, 1979 pp. 239-254.
30. Dubuc, E. and J. Penon, Objets compacts dans les topos, J. Austral. Math. Soc. Ser. A 40 (1986), pp. 203-217.
31. Dugundji, J., "Topology," Allin and Bacon, Inc., Boston, 1966.
32. Edalat, A., Domains for computation in mathematics, physics and exact real arithmetic, Bulletin of Symbolic Logic 3 (1997), pp. 401-452.
33. Edalat, A. and M. Escardó, Integration in Real PCF, in: Proceedings of the Eleventh Annual IEEE Symposium, on Logic. In Computer Science, New Brunswick, New Jersey, USA, 1996, pp. 382-393.
34. Edalat, A. and M. Escardó, Integration in Real PCF, Inform, and Comput. 160 (2000), pp. 128-166.
35. Egli, H. and R. Constable, Computability concepts for programming languages, Theoret. Comput. Sci. 2 (1976), pp. 133-145.
36. Eilenberg, S., Cartesian spaces and local compactees (1985), columbia University, unpublished manuscript.
37. Erker, T., M. Escardó and K. Keimel, The way-below relation of function spaces over semantic domains, Topology Appl. 89 (1998), pp. 61-74.
38. Ershov, Y., Computable functional of finite types, Algebra Logic 11 (1972), pp. 203-242.
39. Ershov, Y., Continuous lattices and A-spaces, Soviet Mathematics Doklady 13 (1973), pp. 1551-1555.
40. Escardó, M., PCF extended with real numbers, Theoret. Comput. Sci. 162 (1996), pp. 79-115.
41. Escardó, M., Real PCF extended with ∃ is universal, in: A. Edalat, S. Jourdan and G. McCusker, editors, Advances in Theory and Formal Methods of Computing: Proceedings of the Third Imperial College Workshop, April 1996 (1996), pp. 13-24.
42. Escardó, M., Injective spaces via the filter monad, Topology Proceedings 22 (1997), pp. 97-110.
43. Escardó, M., PCF extended with real numbers: A domain-theoretic, approach to higher-order exact real number computation, Technical Report ECS-LFCS-97-374, University of Edinburgh (1997), phD thesis at Imperial College.
44. Escardó, M., Effective and sequential definition by cases on the reals via infinite signed-digit numerals, Electron. Notes Theor. Comput. Sci. 13 (1998).
45. Escardó, M., A metric model of PCF (1998), LFCS, University of Edinburgh. Presented at the Workshop on Realizability Semantics and Applications, Federated Logic Conference, Trento, June 29-July 12, 1999. Available at the author's web page.
46. Escardó, M., Properly injective spaces and function spaces, Topology Appl. 89 (1998), pp. 75-120.
47. Escardó, M., Function-space compactifications of function spaces, Topology Appl. 120 (2002), pp. 441-463.
48. Escardó, M., Mathematical foundations of functional programming with real numbers (2003), university of Birmingham, lecture notes for a course in the Midlands Graduate School, available at the author's web page.
49. Escardó, M. and R. Flagg, Semantic domains, injective spaces and monads, Electron. Notes Theor. Comput. Sci. 20 (1999).
50. Escardó, M. and R. Heckmann, Topologies on spaces of continuous functions, Topology Proceedings 26 (2001-2002), pp. 545-564.
51. Escardó, M., M. Hofmann and T. Streicher, On the non-sequential nature of the interval-domain model of exact real-number computation, Math. Struct. Comput. Sci. (to appear).
52. Escardó, M., J. Lawson and A. Simpson, Comparing categories of (core) compactly generated spaces, Topology Appl. (To appear).
53. Escardó, M. and T. Streicher, Induction and recursion on the partial real line with applications to Real PCF, Theoret. Comput. Sci. 210 (1999), pp. 121-157.
54. Gierz, G., K. Hofmann, K. Keimel, J. Lawson, M. Mislove and D. Scott, "A Compendium of Continuous Lattices," Springer, 1980.
55. Gierz, G., K. Hofmann, K. Keimel, J. Lawson, M. Mislove and D. Scott, "Continuous Lattices and Domains," Cambridge University Press, 2003.
56. Gordon, A. D., Bisimilarity as a theory of functional programming, Theoret. Comput. Sci. 228 (1999), pp. 5-47, mathematical foundations of programming semantics (New Orleans, LA, 1995).
57. Gunter, C. A., "Semantics of Programming Languages-Structures and Techniques," The MIT Press, London, 1992.
58. Heckmann, R., Power domains and second-order predicates, Theoret. Comput. Sci. 111 (1993), pp. 59-88.
59. Heckmann, R., A non-topological view of dcpo's as convergence spaces, Theoret. Comp. Sci. 305 (2003), pp. 159-186.
60. Heckmann. R. and M. Huth, Quantitative semantics, topology, and possibility measures, Topology Appl. 89 (1998), pp. 151-178.
61. Hennessy, M. and R. Milner, Algebraic laws for nondeterminism and concurrency, J. Assoc. Comput. Mach. 32 (1985), pp. 137-161.
62. Hofmann, K. and J. Lawson, The spectral theory of distributive continuous lattices, Trans. Amer. Math. Soc. 246 (1978), pp. 285-310.
63. Hofmann, K. and M. Mislove, Local compactness and continuous lattices, in: Continuous Lattices, Lect. Notes Math. 871, 1981, pp. 209-248.
64. Hyland, J., Filter spaces and continuous functional, Ann. Math. Logic 16 (1979), pp. 101-143.
65. Hyland, J. M. E., First steps in synthetic domain theory, in: Category theory (Como, 1990), Lecture Notes in Math. 1488, Springer, Berlin, 1991 pp. 131-156.
66. Hyland, J. M. E. and C.-H. L. Ong, On full abstraction for PCF: I, II and III, Inform. and Comput. 163 (2000), pp. 285-408.
67. Hyland, M., Function spaces in the category of locales., in: Continuous lattices, Lect. Notes Math. 871, 1981, pp. 264-281.
68. Isbell, J., General function spaces, products and continuous lattices, Math. Proc. Camb. Phil. Soc. 100 (1986), pp. 193-205.
69. Johnstone, P., "Stone Spaces," Cambridge University Press, Cambridge, 1982.
70. Johnstone, P., Open locales and exponentiation, in: Mathematical applications of category theory (Denver, Col., 1983), Amer. Math. Soc., Providence, RI, 1984 pp. 84-116.
71. Johnstone, P., Vietoris locales and localic semilattices, in: Continuous lattices and their applications (Bremen, 1982), Dekker, New York, 1985 pp. 155-180.
72. Johnstone, P., ''Sketches of an Elephant: a Topos Theory Compendium," Oxford University Press, 2002.
73. Jones, M. et al., hugs online.
74. Jung, A., Stably compact spaces and the probabilistic powerspace construction, in: J. Desharnais and P. Panangaden, editors, Domain-theoretic Methods in Probabilistic Processes, Electron. Notes Theoret. Comp. Sci. 87 (2004), 15pp.
75. Kahn, G., The semantics of a simple language for parallel programming, in: Information processing 74 (Proc. IFIP Congress, Stockholm, 1974), North-Holland, 1974 pp. 471-475.
76. Keimel, K. and G. Gierz, Halbstetige Funktionen und stetige Verbände, in: R.-E. Hoffmann, editor, Continuous Lattices and Related Topics, Mathematik-Arbeitspapiere 27, Universität Bremen, 1982, pp. 59-67.
77. Keimel, K. and J. Paseka, A direct proof of the Hofmann-Mislove theorem, Proc. Amer. Math. Soc. 120 (1994), pp. 301-303.
78. Kelley, J., "General Topology," D. van Nostrand, New York, 1955.
79. Kleene, S., "Introduction to Metamathematics," North-Holland, 1952.
80. Kleene, S., Countable functionals, in: Constructivity in mathematics: Proceedings of the colloquium held at Amsterdam, 1957 (edited by A. Heyting), Studies in Logic and the Foundations of Mathematics (1959), pp. 81-100.
81. Ko, K.-I., "Complexitity Theory of Real Functions," Birkhauser, Boston, 1991.
82. Kock, A., "Synthetic differential geometry," London Mathematical Society Lecture Note Series 51, Cambridge University Press, Cambridge, 1981.
83. Kreisel, G., Interpretation of analysis by means of constructive functionals of finite types, in: Constructivity in mathematics: Proceedings of the colloquium held at Amsterdam, 1957 (edited by A. Heyting), Studies in Logic and the Foundations of Mathematics (1959), pp. 101-128.
84. Lambek, J. and P. Scott, ''Introduction to Higher Order Categorical Logic," CUP, 1986.
85. Lawson, J., Spaces of maximal points, Math. Struct. Comput. Sci. 7 (1997), pp. 543-555.
86. Longley, J., When is a functional program not a functional program?, in: Proc. 4th International Conference, on Functional Programming, Paris (1999), pp. 1-7.
87. Longley, J., The sequentially realizable functionals, Ann. Pure Appl. Logic 117 (2002), pp. 1-93.
88. Longo, G., Some topologies for computations, in: Proceedings of Géométrie au XX siècle, 1930 - 2000, Paris.
89. Mac Lane, S., "Categories for the Working Mathematician," Springer, 1971.
90. McLarty, C., "Elementary Categories, Elementary Toposes," Clarendon Press, Oxford, 1992.
91. Menni, M. and A. Simpson, Topological and limit-space subcategories of countably-based equilogical spaces, Math. Struct. Comput. Sci. 12 (2002), pp. 739-770.
92. Milner, R., Fully abstract models of typed λ-calculi, Theoret. Comput. Sci. 4 (1977), pp. 1-22.
93. Mislove, M., Topology, domain theory and theoretical computer science, Topology Appl. 89 (1998), pp. 3-59.
94. Myhill, J. and J. C. Shepherdson, Effective operations on partial recursive functions, Z. Math. Logik Grundlagen Math, l (1955), pp. 310-317.
95. Nerode, A., Some Stone spaces and recursion theory, Duke Math. J. 26 (1959), pp. 397-406.
96. Normann, D., "Recursion on the countable functionals," Lee. Not. Math. 811, Springer, Berlin, 1980, viii-191 pp.
97. Normann, D., Computability over the partial continuous functionals, J. Symbolic Logic 65 (2000), pp. 1133-1142.
98. Normann, D., Hierarchies of total functionals over the reals, Theoret. Comput. Sci. (to appear).
99. Paulson, L., "ML for the working programmer," Cambridge University Press, Cambridge, 1991.
100. Pitts, A., Operationally-based theories of program equivalence, in: Semantics and logics of computation (Cambridge, 1995), Publ. Newton Inst. 14, Cambridge Univ. Press, Cambridge, 1997 pp. 241-298.
101. Plotkin, G., LCF considered as a programming language, Theoret. Comput. Sci. 5 (1977), pp. 223-255.
102. ω as a universal domain, J. Comput. System Sci. 17 (1978), pp. 209-236.
103. Plotkin, G., Pisa notes on domains (1983), department of Computer Science, University of Edinburgh. Available at the author's web page.
104. Plotkin, G., Ignorance and uncertainty (2003), lectures given at McGill University's Bellairs Research Institute, Barbados.
105. Poigne, A., Basic category theory, in: Handbook of logic in computer science, Vol. 1, Oxford Univ. Press, New York, 1992 pp. 413-640.
106. Pour-El, M. and J. Richards, "Computability in analysis and physics," Perspectives in Mathematical Logic, Springer, Berlin, 1989, xii+206 pp.
107. Robinson, E., Logical aspects of denotational semantics, Lec. Not. Comput. Sci. 283, 1987 pp. 238-253.
108. Rogers, H., "Theory of Recursive Functions and Effective Computability," McGraw-Hill, New York, 1967.
109. Rosolini, G., Equilogical spaces and filter spaces, Rend. Circ. Mat. Palermo (2) Suppl. 64 (2000), pp. 157-175, categorical studies in Italy (Perugia, 1997).
110. Rosolini, G. and T. Streicher, Comparing models of higher type computation, Electron, not. Comput. Sci. 23 (1999), p. 7.
111. Scott, D., Continuous lattices, Lee. Not. Math. 274, 1972, pp. 97-136.
112. Scott, D., Data types as lattices, SIAM J. Comput. 5 (1976), pp. 522-587.
113. Scott, D., A type-theoretical alternative to CUCH, ISWIM and OWHY, Theoret. Comput. Sci. 121 (1993), pp. 411-440, reprint of a 1969 manuscript.
114. Scott, D., A new category? Domains, spaces and equivalence relations (1996), computer Science Department, Carnagie Mellon University. Available at the author's web page.
115. Scott, D., Effective versions of equilogical spaces, Electron. Notes Theor. Comput. Sci. 35 (2000).
116. Scott, D., A new category for semantics, Lec. Not. Comput. Sci. 2136 (2001), pp. 1-2.
117. Simmons, G., ''Introduction to Topology and Modern Analysis," McGraw-Hill, New York, 1963.
118. Simpson, A., Lazy functional algorithms for exact real functionals, Lec. Not. Comput. Sci. 1450 (1999), pp. 323-342.
119. Simpson, A., Towards a convenient category of topological domains, in: Proceedings of 13th ALGI Workshop, RIMS, Kyoto University, 2003.
120. Smyth, M., Effectively given domains, Theoret. Comput. Sci. 5 (1977), pp. 256-274.
121. Smyth, M., Power domains and predicate transformers: a topological view, Lec. Not. Comput. Sci. 154, 1983, pp. 662-675.
122. Smyth, M., Topology, in: S. Abramsky, D. Gabbay and T. Maibaum, editors, Handbook of Logic, in Computer Science, Oxford science publications 1, Clarendon Press, Oxford, 1992 pp. 641-761.
123. Smyth, M. and G. Plotkin, The category-theoretic solution of recursive, domain equations, SIAM J. Comput. 11 (1982), pp. 761-783.
124. Stoltenberg-Hansen, V., I. Lindström and E. Griffor, "Mathematical theory of domains," CUP, 1994, xii+349 pp.
125. Stoltenberg-Hansen, V. and J. Tucker, Concrete models of computation for topological algebras, Theoret. Comput. Sci. 219 (1999), pp. 347-378.
126. Stone, M. H., The theory of representations for Boolean algebras, Trans. Amer. Math. Soc. 40 (1936), pp. 37-111.
127. Stone, M. H., Applications of the theory of Boolean rings to general topology, Trans. Amer. Math. Soc. 41 (1937), pp. 375-481.
128. Streicher, T., Mathematical foundations of functional programming (2003), department of mathematics, University of Darmstadt. Available at the author's web page.
129. Sutherland, W. A., "Introduction to metric and topological spaces," Clarendon Press, Oxford, 1975, xiii+181 pp.
130. Taylor, P., "Practical foundations of mathematics," CUP, 1999, xii+572 pp.
131. Taylor, P., Geometric and higher order logic in terms of abstract Stone duality, Theory Appl. Categ. 7 (2000), pp. No. 15, 284-338.
132. Taylor, P., Local compactness and the Baire category theorem in ASD: a feasibility study, Electron. Notes Theor. Comput. Sci. 69 (2002).
133. Taylor, P., Sober spaces and continuations, Theory Appl. Categ. 10 (2002), pp. No. 12, 248-300.
134. Taylor, P., Subspaces in abstract Stone duality, Theory Appl. Categ. 10 (2002), pp. No. 13, 301-368.
135. Tennent, R. D., Denotational semantics, in: Handbook of logic in computer science, Vol. 3, Oxford Sci. Publ., Oxford Univ. Press, New York, 1994 pp. 169-322.
136. Townsend, C. and S. Vickers, A universal characterization of the double power locale, Theoret. Comput. Sci. (to appear).
137. Tsuiki, H., Computational dimension of topological spaces, Lee. Not. Comput. Sci. 2064 (2001), pp. 323-335.
138. Turing, A., A correction., Proc. Lond. Math. Soc., II. Ser. 43 (1936), pp. 544-546.
139. Turing, A., On computable numbers, with an application to the Entscheidungsproblem., Proc. Lond. Math. Soc., II. Ser. 42 (1936), pp. 230-265.
140. Vickers, S., "Topology via Logic," CUP, 1989.
141. Vickers, S., The double powerlocale and exponentiation: a case study in geometric logic (2001), available at the author's web page.
142. Weihrauch, K., "Computable analysis," Springer, 2000, x+285 pp.
143. Weihrauch, K. and C. Kreitz, Representations of the real numbers and the open subsets of the set of real numbers, Ann. Pure and Appl. Logic 35 (1987), pp. 247-260.
144. Wiedmer, E., Computing with infinite objects, Theoret. Comput. Sci. 10 (1980), pp. 133-155.
145. Winskel, G., "The formal semantics of programming languages," Foundations of Computing Series, MIT Press, Cambridge, MA, 1993, xx+361 pp., an introduction.