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

DOI10.1007/978-3-662-49630-5_7zbMATH Open1475.68196OpenAlexW2963841399MaRDI QIDQ2811335FDOQ2811335

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

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

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (6)

• Title not available (Why is that?)
• Title not available (Why is that?)
• On algebras with effectful iteration
• A new foundation for finitary corecursion. The locally finite fixpoint and its properties
• A new foundation for finitary corecursion and iterative 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)