A fixpoint theorem for complete categories
From MaRDI portal
Publication:2525178
DOI10.1007/BF01110627zbMATH Open0149.26105OpenAlexW2085858043MaRDI QIDQ2525178FDOQ2525178
Publication date: 1968
Published in: Mathematische Zeitschrift (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/170906
Cites Work
Cited In (82)
- Title not available (Why is that?)
- Three extensional models of type theory
- Shades of iteration: from Elgot to Kleene
- Linear-time logics -- a coalgebraic perspective
- Well-founded coalgebras, revisited
- Initial Algebras of Terms with Binding and Algebraic Structure
- Fractal Sets as Final Coalgebras Obtained by Completing an Initial Algebra
- The eventual image
- Fantastic morphisms and where to find them. A guide to recursion schemes
- Sets with structure, mappings and fixed point property: fixed point structures
- Algebraic dynamical systems in machine learning
- Retracing some paths in categorical semantics: from process-propositions-as-types to categorified reals and computers
- Interleaving data and effects
- Title not available (Why is that?)
- On systems of equations defining infinite graphs
- A categorical derivation of Lebesgue integration
- Monoidal streams for dataflow programming
- From Grammars and Automata to Algebras and Coalgebras
- 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
- On products of transition systems
- Terminal coalgebras and free iterative theories
- On final coalgebras of power-set functors and saturated trees
- Categorical fixed point calculus
- On functors preserving coproducts and algebras with iterativity
- Coalgebraic semantics for nominal automata
- Recursive coalgebras of finitary functors
- Initial algebra semantics for lambda calculi
- Coalgebraic analysis of subgame-perfect equilibria in infinite games without discounting
- Aspects of predicative algebraic set theory. I: Exact completion
- Inductive data types for predicate transformers
- Title not available (Why is that?)
- Categories
- Infinite hypergraphs. I: Basic properties
- Recursive program schemes and context-free monads
- Wellfounded trees in categories
- The category-theoretic solution of recursive program schemes
- Pointwise extensions of GSOS-defined operations
- Final Dialgebras: From Categories to Allegories
- A synthetic theory of sequential domains
- Categorial generalization of algebraic recursion theory
- Equational properties of iteration in algebraically complete categories
- Distributivity of categories of coalgebras
- On the greatest fixed point of a set functor
- Unifying structured recursion schemes
- The equational logic of fixed points
- (Co)Algebraic Characterizations of Signal Flow Graphs
- Infinite trees and completely iterative theories: A coalgebraic view
- On iteratable endofunctors
- Completely iterative algebras and completely iterative monads
- Least fixed point of a functor
- Polynomial functors and combinatorial Dyson–Schwinger equations
- A Coalgebraic View of Infinite Trees and Iteration
- μ-Bicomplete Categories and Parity Games
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets
- Aspects of Categorical Recursion Theory
- Recursive coalgebras from comonads
- Coequational logic for accessible functors
- On second-order iterative monads
- Complete Iterativity for Algebras with Effects
- Structural congruence for bialgebraic semantics
- On algebras with effectful iteration
- On rational monads and free iterative theories
- Coalgebras in functional programming and type theory
- Least fixpoints of endofunctors of cartesian closed categories
- Categorical data types in parametric polymorphism
- Free \(\mu\)-lattices
- A new foundation for finitary corecursion and iterative algebras
- Practical coinduction
- A description based on languages of the final non-deterministic automaton
- Title not available (Why is that?)
- A general theory of self-similarity
- On the equational definition of the least prefixed point.
- Hausdorff coalgebras
- Universal type structures with unawareness
- Type Fusion
- A New Foundation for Finitary Corecursion
- The bicategory-theoretic solution of recursive domain equations
- Coalgebra and abstraction
- Elgot theories: a new perspective on the equational properties of iteration
- Weak $\infty$-categories via terminal coalgebras
- Tail recursion through universal invariants
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)
