We begin with some remarks explaining the structure of this article. After some introductory
statements in the following paragraphs, we summarize the historic development of what is …

Stable partial metric spaces form a fundamental concept in Quantitative Domain Theory.
Indeed, all domains have been shown to be quantifiable via a stable partial metric. Monoid …

In 1995, Schellekens introduced the complexity (quasi-metric) space as a part of the
development of a topological foundation for the complexity analysis of algorithms. Recently …

A quasi-metric space (X, d) is called sup-separable if (X, ds) is a separable metric space,
where ds (x, y)= max {d (x, y), d (y, x)} for all x, y∈ X. We characterize those preferences …

The study of the dual complexity space, introduced by S. Romaguera and MP Schellekens
[Quasi-metric properties of complexity spaces, Topol. Appl. 98 (1999), pp. 311–322] …

In Denotational Semantics one of the aims consists of giving mathematical models of
programming languages so that the meaning of a recursive algorithm can be obtained as an …

Compositionality is the “golden key” to static analysis and plays a central role in static worst-
case time analysis. We show that compositionality, combined with the capacity for tracking …

Dual complexity spaces were introduced by Romaguera and Schellekens in order to obtain
a robust mathematical model for the complexity analysis of algorithms and programs. This …

We study the continuity of linear relations defined on asymmetric normed spaces with values
in normed spaces. We give some geometric charactirization of these mappings. As an …

Compactness and paracompactness have been explored within the framework of partial
metric spaces. It has been demonstrated that while a partial metric space may not be …