A new foundation for finitary corecursion. The locally finite fixpoint and its properties

DOI10.1007/978-3-662-49630-5_7MaRDI QIDQ2811335zbMATH OpenOpenAlexFDO

Authors Stefan Milius, Dirk Pattinson, Thorsten Wißmann

Publication date 10 June 2016

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-49630-5_7

Mathematics Subject Classification ID

Algebraic theory of languages and automata (68Q70) Categories of machines, automata (18B20)

Recommendations

• A new foundation for finitary corecursion and iterative algebras
• Finite behaviours and finitary corecursion
• Proper functors and fixed points for finite behaviour
• Recursive coalgebras of finitary functors
• Universal coalgebra: A theory of systems

Cites work

• scientific article; zbMATH DE number 3458870 (Why is no real title available?)
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 1304993 (Why is no real title available?)
• scientific article; zbMATH DE number 575948 (Why is no real title available?)
• scientific article; zbMATH DE number 626734 (Why is no real title available?)
• scientific article; zbMATH DE number 195199 (Why is no real title available?)
• scientific article; zbMATH DE number 233974 (Why is no real title available?)
• A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
• A fixpoint theorem for complete categories
• A new foundation for finitary corecursion. The locally finite fixpoint and its properties
• Bialgebras for structural operational semantics: an introduction
• Coalgebraic characterizations of context-free languages
• Coequalizers and free triples
• Combining effects: sum and tensor
• Context-free coalgebras
• Elgot theories: a new perspective on the equational properties of iteration
• Equational properties of iterative monads
• Finitary corecursion for the infinitary lambda calculus
• Fundamental properties of infinite trees
• Generalizing determinization from automata to coalgebras
• Handbook of weighted automata
• Infinite trees and completely iterative theories: A coalgebraic view
• Iterative algebras at work
• Lokal präsentierbare Kategorien. (Locally presentable categories)
• Monads of coalgebras: rational terms and term graphs
• Non-deterministic Kleene coalgebras
• On second-order iterative monads
• Quantitative Kleene coalgebras
• Rational operational models
• Real-Time Strict Deterministic Languages
• Sound and complete axiomatizations of coalgebraic language equivalence
• Sur divers produits de séries formelles
• The category-theoretic solution of recursive program schemes
• Towards a Coalgebraic Chomsky Hierarchy
• Trace semantics via generic observations
• Universal coalgebra: A theory of systems

Cited in

(10)

• Initial algebras unchained -- a novel initial algebra construction formalized in Agda
• scientific article; zbMATH DE number 7471662 (Why is no real title available?)
• On algebras with effectful iteration
• A new foundation for finitary corecursion. The locally finite fixpoint and its properties
• Finite behaviours and finitary corecursion
• Proper functors and fixed points for finite behaviour
• Relative fixed points of functors
• A new foundation for finitary corecursion and iterative algebras
• Categorical liveness checking by corecursive algebras
• Product rules and distributive laws

This page was built for publication: A new foundation for finitary corecursion. The locally finite fixpoint and its properties

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2811335)