On the Yoneda completion of a quasi-metric space
Theoretical Computer Science
A characterization of partial metrizability: domains are quantifiable
Theoretical Computer Science - Topology in computer science
Mathematical Structures in Computer Science
The correspondence between partial metrics and semivaluations
Theoretical Computer Science - Mathematical foundations of programming semantics
Partial metrisability of continuous posets
Mathematical Structures in Computer Science
Fundamental study: Complete and directed complete Ω-categories
Theoretical Computer Science
Fuzzy Sets and Systems
On Domain Theory over Girard Quantales
Fundamenta Informaticae
Enriched Categories and Quasi-uniform Spaces
Electronic Notes in Theoretical Computer Science (ENTCS)
Implication structures, fuzzy subsets, and enriched categories
Fuzzy Sets and Systems
Simulation hemi-metrics between infinite-state stochastic games
FOSSACS'08/ETAPS'08 Proceedings of the Theory and practice of software, 11th international conference on Foundations of software science and computational structures
The limit–colimit coincidence theorem for -categories
Mathematical Structures in Computer Science
The formal ball model for -categories
Mathematical Structures in Computer Science
On Domain Theory over Girard Quantales
Fundamenta Informaticae
ICFCA'12 Proceedings of the 10th international conference on Formal Concept Analysis
Probabilistic metric spaces as enriched categories
Fuzzy Sets and Systems
Weighted modal transition systems
Formal Methods in System Design
| Hi-index | 5.23 |