Denotational semantics for programming languages, balanced quasi-metrics and fixed points
From MaRDI portal
Publication:5459745
DOI10.1080/00207160701210653zbMath1146.68049OpenAlexW2068718645MaRDI QIDQ5459745
Oscar Valero, Jesús Rodríguez-López, Salvador Romaguera
Publication date: 29 April 2008
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160701210653
Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Theory of programming languages (68N15) Semantics in the theory of computing (68Q55)
Related Items
On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms, A characterisation of weightable quasi-metric generating functions, Fractal dimension for fractal structures: applications to the domain of words, New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces, On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms, The complexity space of partial functions: a connection between complexity analysis and denotational semantics, Domain theoretic characterisations of quasi-metric completeness in terms of formal balls, Notes on ``Modeling the dynamics of concurrent computing systems, The Hausdorff fuzzy quasi-metric, Modeling the dynamics of concurrent computing systems, New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs, Aggregation of asymmetric distances in computer science, On balancedness and D-completeness of the space of semi-Lipschitz functions, The average running time of an algorithm as a midpoint between fuzzy sets, Complete partial metric spaces have partially metrizable computational models, Complete partial metric spaces have partially metrizable computational models, An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words, A quasi-metric computational model from modular functions on monoids
Cites Work
- Partial metric monoids and semivaluation spaces
- On completeness in quasi-metric spaces
- Cauchy sequences in quasi-pseudo-metric spaces
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Applications of utility functions defined on quasi-metric spaces
- Ordered fractal semigroups as a model of computation
- The correspondence between partial metrics and semivaluations
- Partial Metric Topology
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
