Solving reflexive domain equations in a category of complete metric spaces

DOI10.1016/0022-0000(89)90027-5zbMATH Open0717.18002OpenAlexW1995902462MaRDI QIDQ753944FDOQ753944

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

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

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)

Cites Work

• The Category-Theoretic Solution of Recursive Domain Equations
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Processes and the denotational semantics of concurrency
• Denotational semantics of a parallel object-oriented language

Cited In (83)

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

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)