Submetrizable Yoneda complete structures for a metric dcpo
Josefa Marín, Salvador Romaguera · AIP conference proceedings · 2012
We show that every metric dcpo admits a quantitative computational model defined by a submetrizable Yoneda complete quasi-metric dcpo that preserves the main computational interpretations derived from the order structure of the metric dcpo and allows us to distinguish between comparable and non comparable objects. The Baire metric on the domain of words and the complexity space are typical examples where our approach nicely works.