A fixpoint theorem for complete categories
From MaRDI portal
Publication:2525178
Cites work
- A lattice-theoretical fixpoint theorem and its applications
- scientific article; zbMATH DE number 3216275 (Why is no real title available?)
- scientific article; zbMATH DE number 3220362 (Why is no real title available?)
- scientific article; zbMATH DE number 3195417 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
Cited in
(86)- Equational properties of iteration in algebraically complete categories
- Least fixed point of a functor
- Inductive data types for predicate transformers
- Categories
- The equational logic of fixed points
- Infinite trees and completely iterative theories: A coalgebraic view
- On the equational definition of the least prefixed point.
- Wellfounded trees in categories
- On functors preserving coproducts and algebras with iterativity
- Completely iterative algebras and completely iterative monads
- On algebras with effectful iteration
- Infinite hypergraphs. I: Basic properties
- Distributivity of categories of coalgebras
- Categorial generalization of algebraic recursion theory
- Coalgebra and abstraction
- Hausdorff coalgebras
- Coalgebraic semantics for nominal automata
- A new foundation for finitary corecursion and iterative algebras
- Universal type structures with unawareness
- A description based on languages of the final non-deterministic automaton
- Recursive coalgebras from comonads
- Terminal coalgebras and free iterative theories
- On final coalgebras of power-set functors and saturated trees
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- On rational monads and free iterative theories
- On iteratable endofunctors
- The bicategory-theoretic solution of recursive domain equations
- On products of transition systems
- Complete iterativity for algebras with effects
- Recursive program schemes and context-free monads
- Polynomial functors and combinatorial Dyson-Schwinger equations
- Pointwise extensions of GSOS-defined operations
- Elgot theories: a new perspective on the equational properties of iteration
- From grammars and automata to algebras and coalgebras
- Type Fusion
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- The topology-free construction of the universal type structure for conditional probability systems
- Structural congruence for bialgebraic semantics
- Recursive coalgebras of finitary functors
- Three extensional models of type theory
- A synthetic theory of sequential domains
- Least fixpoints of endofunctors of cartesian closed categories
- Categorical data types in parametric polymorphism
- μ-Bicomplete Categories and Parity Games
- A coalgebraic view of infinite trees and iteration
- Final Dialgebras: From Categories to Allegories
- Rule formats for nominal process calculi
- scientific article; zbMATH DE number 7379288 (Why is no real title available?)
- Aspects of categorical recursion theory
- Efficient lambda encodings for Mendler-style coinductive types in Cedille
- Categorical fixed point calculus
- Monotone recursive types and recursive data representations in Cedille
- Arrows of Times, Non Integer Operators, Self-Similar Structures, Zeta Functions and Riemann Hypothesis: a Synthetic Categorical Approach
- Weak -categories via terminal coalgebras
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Well-founded coalgebras, revisited
- Practical coinduction
- Interleaving data and effects
- Unifying structured recursion schemes. An extended study
- Initial algebras of terms with binding and algebraic structure
- (Co)algebraic characterizations of signal flow graphs
- Fractal sets as final coalgebras obtained by completing an initial algebra
- Initial algebra semantics for lambda calculi
- Free -lattices
- A categorical derivation of Lebesgue integration
- Fantastic morphisms and where to find them. A guide to recursion schemes
- Sets with structure, mappings and fixed point property: fixed point structures
- Coequational logic for accessible functors
- Algebraic dynamical systems in machine learning
- On systems of equations defining infinite graphs
- A general theory of self-similarity
- On second-order iterative monads
- Coalgebras in functional programming and type theory
- Shades of iteration: from Elgot to Kleene
- Linear-time logics -- a coalgebraic perspective
- The eventual image
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Monoidal streams for dataflow programming
- On the greatest fixed point of a set functor
- Tail recursion through universal invariants
- Coinductive streams in monoidal categories
- Iterating both and neither: with applications to the paradoxes
- Topology-free type structures with conditioning events
- Initial algebras unchained -- a novel initial algebra construction formalized in Agda
- The category-theoretic solution of recursive program schemes
- Aspects of predicative algebraic set theory. I: Exact completion
This page was built for publication: A fixpoint theorem for complete categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2525178)
