Denotational semantics for programming languages, balanced quasi-metrics and fixed points
From MaRDI portal
Publication:5459745
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
Cites work
- scientific article; zbMATH DE number 3789474 (Why is no real title available?)
- scientific article; zbMATH DE number 1049043 (Why is no real title available?)
- scientific article; zbMATH DE number 1101628 (Why is no real title available?)
- scientific article; zbMATH DE number 1107487 (Why is no real title available?)
- Applications of utility functions defined on quasi-metric spaces
- Cauchy sequences in quasi-pseudo-metric spaces
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- On completeness in quasi-metric spaces
- Ordered fractal semigroups as a model of computation
- Partial Metric Topology
- Partial metric monoids and semivaluation spaces
- The correspondence between partial metrics and semivaluations
Cited in
(21)- The complexity space of partial functions: a connection between complexity analysis and denotational semantics
- On fixed point theory in topological posets, extended quasi-metric spaces and an application to asymptotic complexity of algorithms
- Aggregation of asymmetric distances in computer science
- Denotational semantics in the cpo and metric approach
- An introduction to metric semantics: Operational and denotational models for programming and specification languages
- An Application of Generalized Complexity Spaces to Denotational Semantics via the Domain of Words
- 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
- Fractal dimension for fractal structures: applications to the domain of words
- A characterisation of weightable quasi-metric generating functions
- On Fixed Point Theory in Partially Ordered (Quasi-)metric Spaces and an Application to Complexity Analysis of Algorithms
- A mathematical model for network with structures in the mesoscale
- New results on the Baire partial quasi-metric space, fixed point theory and asymptotic complexity analysis for recursive programs
- Denotational models for programming languages: Applications of Banach's fixed point theorem
- Notes on ``Modeling the dynamics of concurrent computing systems
- New results on the mathematical foundations of asymptotic complexity analysis of algorithms via complexity spaces
- The Hausdorff fuzzy quasi-metric
- Domain theoretic characterisations of quasi-metric completeness in terms of formal balls
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)
