Pages that link to "Item:Q2525178"
From MaRDI portal
The following pages link to A fixpoint theorem for complete categories (Q2525178):
Displaying 50 items.
- Regular behaviours with names: on rational fixpoints of endofunctors on nominal sets (Q328657) (← links)
- Structural congruence for bialgebraic semantics (Q338626) (← links)
- A synthetic theory of sequential domains (Q424548) (← links)
- Coequational logic for accessible functors (Q618173) (← links)
- A general theory of self-similarity (Q626101) (← links)
- On second-order iterative monads (Q639639) (← links)
- Coalgebras in functional programming and type theory (Q639643) (← links)
- On the greatest fixed point of a set functor (Q672316) (← links)
- Tail recursion through universal invariants (Q685396) (← links)
- The category-theoretic solution of recursive program schemes (Q860876) (← links)
- Aspects of predicative algebraic set theory. I: Exact completion (Q958492) (← links)
- Equational properties of iteration in algebraically complete categories (Q1128480) (← links)
- Least fixed point of a functor (Q1134211) (← links)
- Inductive data types for predicate transformers (Q1199549) (← links)
- Categories (Q1255566) (← links)
- The equational logic of fixed points (Q1391734) (← links)
- Infinite trees and completely iterative theories: A coalgebraic view (Q1399957) (← links)
- On the equational definition of the least prefixed point. (Q1401250) (← links)
- Wellfounded trees in categories (Q1577483) (← links)
- On functors preserving coproducts and algebras with iterativity (Q1727997) (← links)
- Completely iterative algebras and completely iterative monads (Q1767976) (← links)
- On algebras with effectful iteration (Q1798792) (← links)
- Infinite hypergraphs. I: Basic properties (Q1814126) (← links)
- Distributivity of categories of coalgebras (Q1884878) (← links)
- Categorial generalization of algebraic recursion theory (Q1898417) (← links)
- Coalgebra and abstraction (Q1981994) (← links)
- Hausdorff coalgebras (Q2024924) (← links)
- Coalgebraic semantics for nominal automata (Q2104476) (← links)
- A new foundation for finitary corecursion and iterative algebras (Q2304521) (← links)
- Universal type structures with unawareness (Q2437179) (← links)
- A description based on languages of the final non-deterministic automaton (Q2449045) (← links)
- Recursive coalgebras from comonads (Q2495640) (← links)
- Terminal coalgebras and free iterative theories (Q2500475) (← links)
- On final coalgebras of power-set functors and saturated trees (Q2516577) (← links)
- A New Foundation for Finitary Corecursion (Q2811335) (← links)
- On Rational Monads and Free Iterative Theories (Q2842813) (← links)
- On Iteratable Endofunctors (Q2842827) (← links)
- The Bicategory-Theoretic Solution of Recursive Domain Equations (Q2864151) (← links)
- On Products of Transition Systems (Q2873664) (← links)
- Complete Iterativity for Algebras with Effects (Q2888475) (← links)
- Recursive Program Schemes and Context-Free Monads (Q2919447) (← links)
- Polynomial functors and combinatorial Dyson–Schwinger equations (Q2981022) (← links)
- Pointwise extensions of GSOS-defined operations (Q3005990) (← links)
- Elgot theories: a new perspective on the equational properties of iteration (Q3005993) (← links)
- From Grammars and Automata to Algebras and Coalgebras (Q3014929) (← links)
- Type Fusion (Q3067469) (← links)
- (Q3384075) (← links)
- Recursive coalgebras of finitary functors (Q3512598) (← links)
- Three extensional models of type theory (Q3625679) (← links)
- Least fixpoints of endofunctors of cartesian closed categories (Q4279245) (← links)
