Solving reflexive domain equations in a category of complete metric spaces

DOI10.1016/0022-0000(89)90027-5MaRDI QIDQ753944zbMATH OpenOpenAlexFDO

Authors Pierre America, Jan J. M. M. Rutten

Publication date 1989

Published in Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL https://ir.cwi.nl/pub/1646

zbMATH Keywords

fixed pointscategory of complete metric spacescontracting functorreflexive domain equations

Mathematics Subject Classification ID

Categorical methods in general topology (54B30) Semantics in the theory of computing (68Q55) Limits and colimits (products, sums, directed limits, pushouts, fiber products, equalizers, kernels, ends and coends, etc.) (18A30) Special properties of functors (faithful, full, etc.) (18A22)

Recommendations

• scientific article; zbMATH DE number 4085874
• scientific article; zbMATH DE number 1231456
• The category-theoretic solution of recursive metric-space equations
• scientific article; zbMATH DE number 1231447
• The bicategory-theoretic solution of recursive domain equations
• I-categories as a framework for solving domain equations
• Reflexive domains and fixed points
• Categoricity in homogeneous complete metric spaces
• Solving equation systems in ω-categorical algebras

Cites work

• scientific article; zbMATH DE number 3581219 (Why is no real title available?)
• scientific article; zbMATH DE number 195199 (Why is no real title available?)
• scientific article; zbMATH DE number 3232606 (Why is no real title available?)
• scientific article; zbMATH DE number 3379785 (Why is no real title available?)
• Denotational semantics of a parallel object-oriented language
• Processes and the denotational semantics of concurrency
• The Category-Theoretic Solution of Recursive Domain Equations

Cited in

(83)

• Sets with structure, mappings and fixed point property: fixed point structures
• A process calculus for spiking neural P systems
• Coalgebraic representation theory of fractals
• The limit–colimit coincidence theorem for -categories
• Realization of coinductive types
• A structural co-induction theorem
• Generalizing finiteness conditions of labelled transition systems
• scientific article; zbMATH DE number 7566072 (Why is no real title available?)
• Yoneda completeness and flat completeness of ordered fuzzy sets
• Topological models for higher order control flow
• A step-indexed Kripke model of hidden state
• Pseudo-superstructures as nonstandard universes
• StkTokens: enforcing well-bracketed control flow and stack encapsulation using linear capabilities
• The asymmetric topology of computer science
• De Bakker-Zucker processes revisited
• Extending set functors to generalised metric spaces
• Abstraction and subsumption in modular verification of C programs
• A Kripke logical relation for effect-based program transformations
• Step-indexed Kripke model of separation logic for storable locks
• Bisimulation for probabilistic transition systems: a coalgebraic approach
• Trees and semantics
• Models for a paraconsistent set theory
• Elements of generalized ultrametric domain theory
• A coalgebraic view of infinite trees and iteration
• A fixed-point theorem in a category of compact metric spaces
• Abstraction and subsumption in modular verification of C programs
• An introduction to metric semantics: Operational and denotational models for programming and specification languages
• Specification patterns for reasoning about recursion through the store
• Final coalgebras in accessible categories
• The formal ball model for \(\mathcal Q\)-categories
• A layered semantics for a parallel object-oriented language
• On the final sequence of a finitary set functor
• Approximation in quantale-enriched categories
• Iris from the ground up: a modular foundation for higher-order concurrent separation logic
• Nonwellfounded sets and programming language semantics
• scientific article; zbMATH DE number 1497789 (Why is no real title available?)
• The category-theoretic solution of recursive program schemes
• Contractions in comparing concurrency semantics
• Realisability semantics of parametric polymorphism, general references and recursive types
• A general construction of hyperuniverses
• Topology, domain theory and theoretical computer science
• Bisimulation for probabilistic transition systems: A coalgebraic approach
• Complete iterativity for algebras with effects
• Universal coalgebra: A theory of systems
• Rendez-vous with metric semantics
• Comparative metric semantics for concurrent PROLOG
• Initial algebras and terminal coalgebras in many-sorted sets
• Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
• A relational realizability model for higher-order stateful ADTs
• scientific article; zbMATH DE number 7731060 (Why is no real title available?)
• The equational logic of fixed points
• Nested Hoare Triples and Frame Rules for Higher-Order Store
• I-categories as a framework for solving domain equations
• A characterization of distance between 1-bounded compact ultrametric spaces through a universal space
• Infinite trees and completely iterative theories: A coalgebraic view
• On final coalgebras of continuous functors
• The category-theoretic solution of recursive metric-space equations
• Terminal metric spaces of finitely branching and image finite linear processes
• Comparative semantics for flow of control in logic programming without logic
• Scott approach distance on metric spaces
• Processes and hyperuniverses
• Choice principles in hyperuniverses
• scientific article; zbMATH DE number 4085874 (Why is no real title available?)
• Continuity spaces: Reconciling domains and metric spaces
• Processes as terms: non-well-founded models for bisimulation
• Denotational models for programming languages: Applications of Banach's fixed point theorem
• The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
• Banach's fixed-point theorem as a base for data-type equations
• Structural induction and coinduction in a fibrational setting
• Recursively defined metric spaces without contraction
• Liminf convergence in \(\Omega\)-categories
• The connection between initial and unique solutions of domain equations in the partial order and metric approach
• Completely iterative algebras and completely iterative monads
• Equational properties of iteration in algebraically complete categories
• Semantic models for concurrent logic languages
• A behavioural pseudometric for probabilistic transition systems
• Three metric domains of processes for bisimulation
• On iteratable endofunctors
• Approximating and computing behavioural distances in probabilistic transition systems
• On coalgebras over algebras
• A Note on Hyperspaces and Terminal Coalgebras
• On coalgebras over algebras
• Four domains for concurrency

This page was built for publication: Solving reflexive domain equations in a category of complete metric spaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q753944)