Denotational semantics for programming languages, balanced quasi-metrics and fixed points
DOI10.1080/00207160701210653zbMATH Open1146.68049OpenAlexW2068718645MaRDI QIDQ5459745FDOQ5459745
Salvador Romaguera, O. Valero, Jesús Rodríguez-López
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
Recommendations
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- The Banach fixed point theorem in fuzzy quasi-metric spaces with application to the domain of words
- On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
- A quasi-metric computational model from modular functions on monoids
Theory of programming languages (68N15) Analysis of algorithms and problem complexity (68Q25) Metric spaces, metrizability (54E35) Semantics in the theory of computing (68Q55)
Cites Work
- The correspondence between partial metrics and semivaluations
- Partial Metric Topology
- Cauchy sequences in quasi-pseudo-metric spaces
- Title not available (Why is that?)
- On completeness in quasi-metric spaces
- Title not available (Why is that?)
- Partial metric monoids and semivaluation spaces
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Applications of utility functions defined on quasi-metric spaces
- Title not available (Why is that?)
- Ordered fractal semigroups as a model of computation
- Title not available (Why is that?)
Cited In (21)
- On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- Denotational semantics in the cpo and metric approach
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Notes on ``Modeling the dynamics of concurrent computing systems
- The Hausdorff fuzzy quasi-metric
- Complete partial metric spaces have partially metrizable computational models
- Modeling the dynamics of concurrent computing systems
- On balancedness and D-completeness of the space of semi-Lipschitz functions
- A quasi-metric computational model from modular functions on monoids
- The average running time of an algorithm as a midpoint between fuzzy sets
- Complete partial metric spaces have partially metrizable computational models
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
- Fractal dimension for fractal structures: applications to the domain of words
- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- Aggregation of asymmetric distances in computer science
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- Domain theoretic characterisations of quasi-metric completeness in terms of formal balls
- A characterisation of weightable quasi-metric generating functions
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
This page was built for publication: Denotational semantics for programming languages, balanced quasi-metrics and fixed points
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5459745)
