A fixpoint theorem for complete categories
From MaRDI portal
Publication:2525178
DOI10.1007/BF01110627zbMath0149.26105OpenAlexW2085858043MaRDI QIDQ2525178
No author found.
Publication date: 1968
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/170906
Related Items (77)
μ-Bicomplete Categories and Parity Games ⋮ Complete Iterativity for Algebras with Effects ⋮ Initial algebra semantics for lambda calculi ⋮ Distributivity of categories of coalgebras ⋮ Categorical fixed point calculus ⋮ Categorial generalization of algebraic recursion theory ⋮ Least fixpoints of endofunctors of cartesian closed categories ⋮ Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets ⋮ Weak $\infty$-categories via terminal coalgebras ⋮ Recursive Program Schemes and Context-Free Monads ⋮ Structural congruence for bialgebraic semantics ⋮ Categorical data types in parametric polymorphism ⋮ The category-theoretic solution of recursive program schemes ⋮ Monotone recursive types and recursive data representations in Cedille ⋮ Unnamed Item ⋮ Arrows of Times, Non Integer Operators, Self-Similar Structures, Zeta Functions and Riemann Hypothesis: a Synthetic Categorical Approach ⋮ Equational properties of iteration in algebraically complete categories ⋮ Least fixed point of a functor ⋮ The equational logic of fixed points ⋮ Coequational logic for accessible functors ⋮ Infinite trees and completely iterative theories: A coalgebraic view ⋮ On the equational definition of the least prefixed point. ⋮ A general theory of self-similarity ⋮ A categorical derivation of Lebesgue integration ⋮ Fantastic morphisms and where to find them. A guide to recursion schemes ⋮ Recursive coalgebras of finitary functors ⋮ Well-founded coalgebras, revisited ⋮ Practical coinduction ⋮ Sets with structure, mappings and fixed point property: fixed point structures ⋮ Algebraic dynamical systems in machine learning ⋮ A synthetic theory of sequential domains ⋮ On systems of equations defining infinite graphs ⋮ Unnamed Item ⋮ Unifying structured recursion schemes ⋮ On second-order iterative monads ⋮ Coalgebras in functional programming and type theory ⋮ Universal type structures with unawareness ⋮ Interleaving data and effects ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Polynomial functors and combinatorial Dyson–Schwinger equations ⋮ A description based on languages of the final non-deterministic automaton ⋮ On functors preserving coproducts and algebras with iterativity ⋮ Pointwise extensions of GSOS-defined operations ⋮ Elgot theories: a new perspective on the equational properties of iteration ⋮ On the greatest fixed point of a set functor ⋮ Coalgebra and abstraction ⋮ From Grammars and Automata to Algebras and Coalgebras ⋮ Tail recursion through universal invariants ⋮ Inductive data types for predicate transformers ⋮ Aspects of predicative algebraic set theory. I: Exact completion ⋮ Initial Algebras of Terms with Binding and Algebraic Structure ⋮ A Coalgebraic View of Infinite Trees and Iteration ⋮ (Co)Algebraic Characterizations of Signal Flow Graphs ⋮ Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra ⋮ Completely iterative algebras and completely iterative monads ⋮ Recursive coalgebras from comonads ⋮ Terminal coalgebras and free iterative theories ⋮ Final Dialgebras: From Categories to Allegories ⋮ Hausdorff coalgebras ⋮ Free \(\mu\)-lattices ⋮ Type Fusion ⋮ On algebras with effectful iteration ⋮ On final coalgebras of power-set functors and saturated trees ⋮ Categories ⋮ Three extensional models of type theory ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras ⋮ Infinite hypergraphs. I: Basic properties ⋮ On Rational Monads and Free Iterative Theories ⋮ On Iteratable Endofunctors ⋮ Wellfounded trees in categories ⋮ Aspects of Categorical Recursion Theory ⋮ The Bicategory-Theoretic Solution of Recursive Domain Equations ⋮ Coalgebraic semantics for nominal automata ⋮ On Products of Transition Systems ⋮ Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
Cites Work
This page was built for publication: A fixpoint theorem for complete categories
