Solving reflexive domain equations in a category of complete metric spaces

DOI10.1016/0022-0000(89)90027-5zbMath0717.18002OpenAlexW1995902462MaRDI QIDQ753944

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 points category of complete metric spaces contracting functor reflexive domain equations

Mathematics Subject Classification ID

Lua error in Module:PublicationMSCList at line 37: attempt to index local 'msc_result' (a nil value).

Related Items (80)

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

Cites Work

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