Towards computing distance between programs via Scott domains
From MaRDI portal
Recommendations
Cited in
(19)- A characterization of partial metrizability: Domains are quantifiable.
- Scott approach distance on metric spaces
- The correspondence between partial metrics and semivaluations
- Fixed point theorems in generalized metric spaces with applications to computer science
- On 0-complete partial metric spaces and quantitative fixed point techniques in denotational semantics
- Fixed points for weak --contractions in partial metric spaces
- Existence and uniqueness for a first-order periodic differential problem via fixed point results
- Some corollaries of the correspondence between partial metrics and multivalued equalities
- Common fixed points in a partially ordered partial metric space
- Common fixed points for self-mappings on partial metric spaces
- Weak condition for generalized f-weakly Picard mappings on partial metric spaces
- Distance and measurement in domain theory
- Weightable quasi-metric semigroups and semilattices
- Weakly weighted generalised quasi-metric spaces and semilattices
- A partial metric semantics of higher-order types and approximate program transformations
- The lambda calculus is quantifiable
- On the metric nature of (differential) logical relations
- Some fixed point results via R-functions
- Partial metric monoids and semivaluation spaces
This page was built for publication: Towards computing distance between programs via Scott domains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4376045)
