The largest Cartesian closed category of domains, considered constructively
Dieter Spreen · Mathematical Structures in Computer Science · 2005
This paper addresses a conjecture of Smyth that says that if -algebraic cpo, and computable maps as morphisms. This is indeed the case: the category of constructive SFP domains is the largest constructively Cartesian closed weakly indexed effectively full subcategory of the category of constructive domains that have a completeness test and satisfy a further effectivity requirement.