1. S. Abramsky and A. Jung. Domain theory. In Handbook of Logic in Computer Science, volume 3, pages 1–168. OUP, 1994.
2. A. Bauer. The Realizability Approach to Computable Analysis and Topology. PhD thesis, Carnegie Mellon University, 2000.
3. A. Bauer, L. Birkedal, and D.S. Scott. Equilogical spaces. Theoretical Computer Science, to appear, 2002.
4. U. Berger. Total sets and objects in domain theory. Annals of Pure and Applied Logic, 60:91–117, 1993.
5. P. Di Gianantonio. A Functional Approach to Computability on Real Numbers. PhD thesis, Università di Pisa, 1993.