Effectivity and density in domains: A survey

Electronic Notes in Theoretical Computer Science

Volumn 23, Issue 1, 1999, Pages 27-39

  Berger, Ulrich ^a  

^a UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; COMPUTER SCIENCE; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; SEMANTICS; SET THEORY; THEOREM PROVING;

COMPUTABILITY; DENSITY THEOREMS; DOMAIN THEORY; TOTALITY;

COMPUTER PROGRAMMING LANGUAGES;

EID: 19044364804     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/S1571-0661(04)00102-1     Document Type: Conference Paper

References (25)

1. Awodey A., Bauer A., Birkedal L., Hughes J., and Scott., D., Logics of Types and Computation, Manuscript, Carnegie Mellon University, 1998
2. Berger U., Totale Objekte und Mengen in der Bereichstheorie, PhD-Thesis, Mathematisches Institut der Universität München, 1990
3. Berger U. Total sets and objects in domain theory. Annals of Pure and Applied Logic. 60:1993;91-117
4. Berger U., Continuous functionals of dependent and transfinite types, Logic Colloquium '97, 1997
5. Blanck J., Domain representability of topological spaces, PhD-thesis, University of Uppsala, 1996
6. Blanck J., Stoltenberg-Hansen V., Tucker, J. V., Streams, stream transformers and domain representations, Prospects for hardware foundations, NADA volume, SLNCS 1546, 1998
7. Ershov Y.L. Model C of partial continuous functionals. Logic Colloquium, 1976. 1977;455-467 North Holland, Amsterdam
8. Griffor E., Lindstroem I., Stoltenberg-Hansen U. Mathematical Theory of Domains. 1993;Cambridge University Press
9. Kleene S.C. Countable functionals. Constructivity in Mathematics. 1959;81-100 North-Holland, Amsterdam
10. Kleene S.C. Recursive functionals and quantifiers of finite type I. T.A.M.S. 91:1959;1-52
11. Kreisel G. Interpretation of analysis by means of constructive functionals of finite types. Constructivity in Mathematics. 1959;101-128 North-Holland, Amsterdam
12. Kreisel G., Lacombe D., Shoenfield J.R. Partial Recursive Functionals and Effective Operations. Constructivity in Mathematics. 1959;290-297 North-Holland, Amsterdam
13. Kristiansen L., Normann D. Interpreting higher computations as types with totality. Arch. Math. Logic. 33:1994;243-259
14. Normann D., Transfinite Hierarchy of Domains with Density, Manuscript, 1993
15. D. Normann, Categories of domains with totality, Preprint Series, InsMatht. UniOslov. 4, 1997
16. D. Normann, The continuous functionals of finite types over the reals, Preprint Series, InsMatht. UniOslov. 19, 1998
17. D. Normann, Computability over the partial continuous functionals, Manuscript, InsMatht. UniOslov., 1998
18. Palmgren E., Stoltenberg-Hansen V. Domain interpretations of Martin-Löf's partial type theory. Annals of Pure and Applied Logic. 48:1990;135-196
19. Platek, R. A., Foundations of recursion theory, PhD-thesis, Department of Mathematics, Stanford University, 1966
20. Plotkin G. LCF considered as a programming language. TCS. 5:1977;223-255
21. Schwichtenberg H. Density and Choice for Total Continuous Functionals. Kreiseliana. About and Around Georg Kreisel. 1996;335-362 Wellesley, Massachusetts
22. Scott D. Data types as lattics. SIAM Jour. Comp. 5:1976;522-587
23. Scott D. Domains for denotational semantics. Automata, Languages and Programming, SLNCS. 140:1982;577-613
24. Troelstra A.S. Matemathematical Investigations of Intuitionistic Arithmetic and Analysis. SLNM. 344:1973
25. Waagbø G., Denotational Semantics for Intuitionistic Type Theory Using a Hierarchy of Domains with Totality, PhD-thesis, University of Oslo, 1997