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