scientific article; zbMATH DE number 3458870
From MaRDI portal
Publication:4044767
Cited in
(86)- Bases for parametrized iterativity
- On the construction of free algebras for equational systems
- A Mezei-Wright theorem for categorical algebras
- Fuzzy-topological automata
- Equational properties of iteration in algebraically complete categories
- Least fixed point of a functor
- Free omega-complete algebras
- Construction of free continuous algebras
- One more categorical model of universal algebra
- Realization theory for automata in categories
- A left adjoint construction related to free triples
- Categorical constructions of free algebras, colimits, and completions of partial algebras
- Banach's fixed-point theorem as a base for data-type equations
- The equational logic of fixed points
- On final coalgebras of continuous functors
- Infinite trees and completely iterative theories: A coalgebraic view
- On coalgebra based on classes
- A survey on the categorical term construction with applications
- How accessible are categories of algebras?
- Equational logic of circular data type specification
- A note on ordinal DFAs
- Corecursion up-to via causal transformations
- A new foundation for finitary corecursion and iterative algebras
- From signatures to monads in \textsf{UniMath}
- On finitary functors and their presentations
- The web monoid and opetopic sets
- Algebras with parametrized iterativity
- Terminal coalgebras and free iterative theories
- On final coalgebras of power-set functors and saturated trees
- Rational operational models
- C-system of a module over a \(Jf\)-relative monad
- Elgot theories: a new perspective of iteration theories (extended abstract)
- A new foundation for finitary corecursion. The locally finite fixpoint and its properties
- Some Wellfounded Trees in UniMath
- On a categorical framework for coalgebraic modal logic
- Final coalgebras and a solution theorem for arbitrary endofunctors
- Induction, coinduction, and adjoints
- Predicate liftings versus nabla modalities
- Recursive program schemes and context-free monads
- The p-adic integers as final coalgebra
- On a category of fuzzy automata with relations
- Companions, codensity and causality
- Minimal realization for fuzzy behaviour: a bicategory-theoretic approach
- Fixed points of set functors: how many iterations are needed?
- Algebraic specification of data types: A synthetic approach
- scientific article; zbMATH DE number 3588574 (Why is no real title available?)
- Relatively terminal coalgebras
- A ghost at _1
- A coalgebraic view of infinite trees and iteration
- From varieties of algebras to covarieties of coalgebras
- LNL-FPC: the linear/non-linear fixpoint calculus
- scientific article; zbMATH DE number 7379294 (Why is no real title available?)
- scientific article; zbMATH DE number 7453968 (Why is no real title available?)
- Complete algebraic semantics for second-order rewriting systems based on abstract syntax with variable binding
- Finitary monads on the category of posets
- List Objects with Algebraic Structure
- Modules in the Category $$\mathtt {\mathbf{Sup}}$$
- Weak -categories via terminal coalgebras
- Finitely presentable algebras for finitary monads
- Simplified coalgebraic trace equivalence
- scientific article; zbMATH DE number 6740664 (Why is no real title available?)
- Term equational systems and logics (extended abstract)
- Fractal sets as final coalgebras obtained by completing an initial algebra
- Fixed Points of Functors - A Short Abstract
- scientific article; zbMATH DE number 7649889 (Why is no real title available?)
- On terminal coalgebras derived from initial algebras
- A categorical derivation of Lebesgue integration
- Constructing initial algebras using inflationary iteration
- The Sierpinski carpet as a final coalgebra
- Structured handling of scoped effects
- On second-order iterative monads
- Categorical approximation fixpoint theory
- Computads for weak -categories as an inductive type
- The eventual image
- Presenting the Sierpinski gasket in various categories of metric spaces
- Monoidal streams for dataflow programming
- Automata and coalgebras in categories of species
- On the greatest fixed point of a set functor
- Algebraic reasoning over relational structures
- The Sierpinski carpet as a final coalgebra
- Automata and coalgebras in categories of species
- Duality for coalgebras for Vietoris and monadicity
- Coinductive streams in monoidal categories
- Initial algebras unchained -- a novel initial algebra construction formalized in Agda
- Fan-causality and uniform continuity on final coalgebras
- Killing epsilons with a dagger: a coalgebraic study of systems with algebraic label structure
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4044767)