Publisher
Springer Berlin Heidelberg
Reference11 articles.
1. Escardó, M. H., PCF extended with real numbers: a domain-theoretic approach to higher-order exact number computation, Thesis, University of London, Imperial College of Science, Technology and medicine (1996).
2. Escardó, M. H., PCF extended with real numbers, Theoretical Computer Science 162(1) pp. 79–115 (1996).
3. Niggl, K.-H., M ω considered as a programming language, Annals of Pure and Applied Logic 99, pp. 73–92 (1999)
4. Normann, D., Computability over the partial continuous functionals, Journal of Symbolic Logic 65, pp. 1133–1142, (2000)
5. Normann, D., The Cook-Berger Problem. A Guide to the solution, In Spreen, D. (ed.): Electronic Notes in Theoretical Computer Science. 2000-10; 35: 9