The category-theoretic solution of recursive metric-space equations

DOI10.1016/j.tcs.2010.07.010zbMath1205.68216OpenAlexW2030299533MaRDI QIDQ604478

Jacob Thamsborg, Kristian Støvring, Lars Birkedal

Publication date: 11 November 2010

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.010

zbMATH Keywords

fixed pointmetric spacerecursive equation

Mathematics Subject Classification ID

Semantics in the theory of computing (68Q55) Special categories (18B99)

Related Items

Ghost signals: verifying termination of busy waiting ⋮ A Kripke logical relation for effect-based program transformations ⋮ A relational realizability model for higher-order stateful ADTs ⋮ The Guarded Lambda-Calculus: Programming and Reasoning with Guarded Recursion for Coinductive Types ⋮ Iris from the ground up: A modular foundation for higher-order concurrent separation logic ⋮ A Higher-Order Logic for Concurrent Termination-Preserving Refinement ⋮ A step-indexed Kripke model of hidden state ⋮ Unnamed Item ⋮ Transfinite Step-Indexing: Decoupling Concrete and Logical Steps

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Metrics for labelled Markov processes
• Semi-metrics, closure spaces and digital topology
• Elements of generalized ultrametric domain theory
• A fixed-point theorem in a category of compact metric spaces
• Solving reflexive domain equations in a category of complete metric spaces
• Recursion over realizability structures
• The connection between initial and unique solutions of domain equations in the partial order and metric approach
• A behavioural pseudometric for probabilistic transition systems
• Relational properties of domains
• Local Reasoning for Storable Locks and Threads
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
• Nested Hoare Triples and Frame Rules for Higher-Order Store
• The Category-Theoretic Solution of Recursive Domain Equations
• Metric spaces, generalized logic, and closed categories
• On the foundations of final coalgebra semantics: non-well-founded sets, partial orders, metric spaces
• Processes and the denotational semantics of concurrency
• A relational modal logic for higher-order stateful ADTs
• State-dependent representation independence
• Typed Lambda Calculi and Applications