Output details

Reducibility of domain representations and Cantor–Weihrauch domain representations

<10> Data representations may or may not be equivalent, with subtle consequences for the portability of software. Non-equivalence is very common for representations of topological data types, which can be modelled by domain representations. The paper introduces the first general theory of how one domain representation may be reduced to another, and when they are computationally equivalent. The theory yields the basic theory of Weihrauch's TTE (Type-2 Theory of Effectivity) as a simple special case.