Computability and totality in domains

Authors:
Ulrich Berger
Affiliations:
Department of Computer Science, University of Wales Swansea
Venue:
Mathematical Structures in Computer Science
Year:
2002

Citing 3
Cited 1

PCF extended with real numbers

Theoretical Computer Science - Special issue on real numbers and computers
Concrete models of computation for topological algebras

Theoretical Computer Science - Special issue on computability and complexity in analysis
Streams, Stream Transformers and Domain Representations

Proceedings of the ESPRIT Working Group 8533 on Prospects for Hardware Foundations: NADA - New Hardware Design Methods, Survey Chapters

Operational domain theory and topology of sequential programming languages

Information and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The purpose of this short paper is to sketch the development of a few basic topics in the history of realizability. The number of topics is quite limited and reflects very much my own personal taste, prejudices and area of competence.