The Category-Theoretic Solution of Recursive Domain Equations
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Merging regular processes by means of fixed-point theory
- Universal profinite domains
- Two-level semantics and code generation
- A safe approach to parallel combinator reduction
- Recursively defined domains and their induction principles
- Substitution revisited
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- A characterization of distance between 1-bounded compact ultrametric spaces through a universal space
- Equational properties of iteration in algebraically complete categories
- \(\mathbb{T}^\omega\) as a universal domain
- Least fixed point of a functor
- Varieties of chain-complete algebras
- Free upper regular bands
- Tree constructions of free continuous algebras
- Sequential algorithms on concrete data structures
- Towards a foundation for semantics in complete metric spaces
- Recursion over realizability structures
- Domain theory in logical form
- Universal homogeneous event structures and domains
- Recursive types for Fun
- Quantitative domains and infinitary algebras
- New foundations for fixpoint computations: FIX-hyperdoctrines and the FIX-logic
- Strictness analysis via abstract interpretation for recursively defined types
- Complete restrictions of the intersection type discipline
- Some economic applications of Scott domains
- The mixed powerdomain
- Algebraically compact functors
- Fixed-point constructions in order-enriched categories
- Categories of embeddings
- Induction and recursion on the partial real line with applications to Real PCF
- On functions preserving levels of approximation: A refined model construction for various lambda calculi
- Structural induction and coinduction in a fibrational setting
- Topology, domain theory and theoretical computer science
- On a generalized product for domains
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- A co-induction principle for recursively defined domains
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Information categories
- Banach's fixed-point theorem as a base for data-type equations
- The connection between initial and unique solutions of domain equations in the partial order and metric approach
- The equational logic of fixed points
- Trees and semantics
- Approximating labelled Markov processes
- On final coalgebras of continuous functors
- A domain-theoretic semantics of lax generic functions.
- Infinite trees and completely iterative theories: A coalgebraic view
- A fully abstract model for the \(\pi\)-calculus.
- Universal coalgebra: A theory of systems
- The generic approximation lemma
- CSP, partial automata, and coalgebras.
- Polymorphic lambda calculus and subtyping.
- Fixpoint operators for domain equations
- Domain theory, testing and simulation for labelled Markov processes
- Categorical fixed point semantics
- Infinite hypergraphs. I: Basic properties
- Recursive domain equations for concrete data structure
- Describing semantic domains with sprouts
- Domain theoretic models of polymorphism
- Equational logic of circular data type specification
- Games and full abstraction for FPC.
- Computational adequacy for recursive types in models of intuitionistic set theory
- Models of nondeterministic regular expressions
- Coalgebraic semantics for nominal automata
- Weakly linear systems for matrices over the max-plus quantale
- Parametrized fixed points and their applications to session types
- A curry-style semantics of interaction: from untyped to second-order lazy -calculus
- Structural operational semantics for continuous state stochastic transition systems
- Terminal coalgebras in well-founded set theory
- Piecewise initial algebra semantics
- A domain equation for bisimulation
- Monads for behaviour
- Towards a quantum domain theory: order-enrichment and fixpoints in W^*-algebras
- Unique, guarded fixed points in an additive setting: extended abstract
- A convenient category of domains
- The bicategory-theoretic solution of recursive domain equations
- Syntactic logical relations for polymorphic and recursive types
- Coalgebraic trace semantics for combined possibilitistic and probabilistic systems
- Atomicity, coherence of information, and point-free structures
- On coalgebras over algebras
- From coalgebraic to monoidal traces
- Initial algebras and terminal coalgebras in many-sorted sets
- CPO-models for second order lambda calculus with recursive types and subtyping
- Coalgebraic representation theory of fractals
- Semantics of higher-order quantum computation via geometry of interaction
- Realisability semantics of parametric polymorphism, general references and recursive types
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Initial Algebra Semantics for Cyclic Sharing Structures
- Nested Hoare Triples and Frame Rules for Higher-Order Store
- Algebraic specification of data types: A synthetic approach
- Compositional characterization of observable program properties
- Universal domains and the amalgamation property
- Least fixpoints of endofunctors of cartesian closed categories
- Projections for polymorphic first-order strictness analysis
- Categorical data types in parametric polymorphism
- The glueing construction and lax limits
- The Impact of the Lambda Calculus in Logic and Computer Science
- A relational realizability model for higher-order stateful ADTs
This page was built for publication: The Category-Theoretic Solution of Recursive Domain Equations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3956379)
