This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Hyland, M. [1979], “Filter spaces and continuous functionals,” Annals of Mathematical Logic 16, 101–143.
Kamimura, T. & Tang, A. [1983], “Total objects of domains,” Technical report, University of Kansas.
Kleene, S. C. [1959], “Countable functionals,” Constructivity in Mathematics, North-Holland, 81–100.
Kreisel, G. [1959], “Interpretation of analysis by means of contructive functionals of finite types,” same as [3], 81–100.
Sciore, E. & Tang, A. [1978], “Computability theory in admissible domains,” Sigact, San Diego, 95–104.
Scott, D. [1972], “Continuous lattices,” Springer Lecture Notes in Mathematics, Vol. 274, 97–136.
Scott, D. [1972], “Lattice theory, data types and semantics,” Formal Semantics of Programming Languages, edited by R. Rustin, Prentice Hall, 65–106.
Scott, D. [1981], “Lecture on a mathematical theory of computation,” Oxford University Computing Laboratory, Technical monograph PRG-19.
Scott, D. [1982], “Domains for denotational semantics,” ICALP, Aarhus, Denmark.
Smyth, M. [1977], “Effectively given domains,” Theoretical Computer Science, Vol. 5, 257–274.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kamimura, T., Tang, A. (1983). Effectively given spaces. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036923
Download citation
DOI: https://doi.org/10.1007/BFb0036923
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive