Stability and computability in coherent domains (Q752707)

Computable and stable functions between Girard's coherent domains are considered. A notion of computability for stable functions is introduced and discussed. The notion of computable functions is based on the recursive enumerability of their traces and is similar to that of computable function in Scott domains. The main result is the characterization of stable and computable functions in terms of so-called regular sets, a notion from the theory of relativized computability. The paper contains several minor misprints. In particular, in {\S} 3 references to definitions 2.4, 2.6 and 2.7 mean definitions 3.7 and 3.8.