The Category-Theoretic Solution of Recursive Domain Equations
From MaRDI portal
Cited in
(only showing first 100 items - show all)- Functorial polymorphism
- Fixed Points of Functors - A Short Abstract
- Nested Hoare Triples and Frame Rules for Higher-Order Store
- Codatatypes in ML
- A structural co-induction theorem
- Set-theoretical and other elementary models of the \(\lambda\)-calculus
- Initial Algebra Semantics for Cyclic Sharing Structures
- I-categories as a framework for solving domain equations
- Monads for behaviour
- Denotational semantics as a foundation for cost recurrence extraction for functional languages
- Realizability Semantics of Parametric Polymorphism, General References, and Recursive Types
- Coalgebraic semantics for nominal automata
- On the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- The glueing construction and lax limits
- The contraction property is sufficient to guarantee the uniqueness of fixed points of endofunctors in a category of complete metric spaces
- Towards a foundation for semantics in complete metric spaces
- Solving reflexive domain equations in a category of complete metric spaces
- Recursively defined domains and their induction principles
- CSP, partial automata, and coalgebras.
- The generic approximation lemma
- Fixpoint operators for domain equations
- Non-deterministic information systems and their domains
- A domain-theoretic semantics of lax generic functions.
- Topology-free type structures with conditioning events
- A co-induction principle for recursively defined domains
- The comparison of a cpo-based semantics with a cms-based semantics for \(CSP\)
- Initial algebras and terminal coalgebras in many-sorted sets
- Projections for polymorphic first-order strictness analysis
- Broad infinity and generation principles
- Complete restrictions of the intersection type discipline
- Universal profinite domains
- Universal homogeneous event structures and domains
- Quantitative domains and infinitary algebras
- Infinite hypergraphs. I: Basic properties
- Strictness analysis via abstract interpretation for recursively defined types
- The mixed powerdomain
- The Impact of the Lambda Calculus in Logic and Computer Science
- A categorical manifesto
- Notions of computation and monads
- Substitution revisited
- Towards a quantum domain theory: order-enrichment and fixpoints in W^*-algebras
- Sequential algorithms on concrete data structures
- Domain interpretations of Martin-Löf's partial type theory
- Categorical fixed point semantics
- Elements of generalized ultrametric domain theory
- A fully abstract model for the \(\pi\)-calculus.
- Merging regular processes by means of fixed-point theory
- From coalgebraic to monoidal traces
- Recursive Domain Equations of Filter Models
- Equational properties of iteration in algebraically complete categories
- Domain theory in logical form
- On functions preserving levels of approximation: A refined model construction for various lambda calculi
- Approximation in quantale-enriched categories
- scientific article; zbMATH DE number 7379294 (Why is no real title available?)
- Games and full abstraction for FPC.
- Computational adequacy for recursive types in models of intuitionistic set theory
- Structural induction and coinduction in a fibrational setting
- On the greatest fixed point of a set functor
- Piecewise initial algebra semantics
- Type inference with simple subtypes
- Weakly linear systems for matrices over the max-plus quantale
- Atomicity, coherence of information, and point-free structures
- An abstract interpretation for ML equality kinds
- Realization of coinductive types
- Non-well-founded sets modeled as ideal fixed points
- Polymorphic lambda calculus and subtyping.
- The equational logic of fixed points
- Approximating labelled Markov processes
- Infinite trees and completely iterative theories: A coalgebraic view
- On final coalgebras of continuous functors
- Fixpoint constructions in focused orthogonality models of linear logic
- \(\mathbb{T}^\omega\) as a universal domain
- Domain theory, testing and simulation for labelled Markov processes
- Compositional characterization of observable program properties
- Universal coalgebra: A theory of systems
- A characterization of distance between 1-bounded compact ultrametric spaces through a universal space
- Parametrized fixed points and their applications to session types
- A completeness theorem for nondeterministic Kleene algebras
- Categories of embeddings
- From term models to domains
- A relational realizability model for higher-order stateful ADTs
- Varieties of chain-complete algebras
- Least fixed point of a functor
- Equational logic of circular data type specification
- The category-theoretic solution of recursive metric-space equations
- Structural operational semantics for continuous state stochastic transition systems
- Categories of quantum cpos
- Banach's fixed-point theorem as a base for data-type equations
- Simulations in coalgebra
- Describing semantic domains with sprouts
- Logical relations and nondeterminism
- A Cook's tour of duality in logic: from quantifiers, through Vietoris, to measures
- Automatic differentiation for ML-family languages: correctness via logical relations
- Coalgebraic representation theory of fractals
- Computational adequacy via ‘mixed’ inductive definitions
- A fixed-point theorem in a category of compact metric spaces
- Tree constructions of free continuous algebras
- Stone duality for relations
- On a generalized product for domains
- Fully abstract semantics for higher order communicating systems (extended abstract)
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)
