A New Foundation for Finitary Corecursion
From MaRDI portal
Publication:2811335
DOI10.1007/978-3-662-49630-5_7zbMath1475.68196OpenAlexW2963841399MaRDI QIDQ2811335
Stefan Milius, Thorsten Wißmann, Dirk Pattinson
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
Related Items (6)
Unnamed Item ⋮ Unnamed Item ⋮ Product Rules and Distributive Laws ⋮ On algebras with effectful iteration ⋮ A New Foundation for Finitary Corecursion ⋮ A new foundation for finitary corecursion and iterative algebras
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Rational operational models
- Quantitative Kleene coalgebras
- Equational properties of iterative monads
- On second-order iterative monads
- Bialgebras for structural operational semantics: an introduction
- Handbook of weighted automata
- The category-theoretic solution of recursive program schemes
- Fundamental properties of infinite trees
- Infinite trees and completely iterative theories: A coalgebraic view
- Universal coalgebra: A theory of systems
- Context-free coalgebras
- Combining effects: sum and tensor
- A fixpoint theorem for complete categories
- Coequalizers and free triples
- Lokal präsentierbare Kategorien. (Locally presentable categories)
- Non-Deterministic Kleene Coalgebras
- A New Foundation for Finitary Corecursion
- Coalgebraic Characterizations of Context-Free Languages
- Trace Semantics via Generic Observations
- Sound and Complete Axiomatizations of Coalgebraic Language Equivalence
- Elgot theories: a new perspective on the equational properties of iteration
- Towards a Coalgebraic Chomsky Hierarchy
- Iterative algebras at work
- Sur divers produits de séries formelles
- Generalizing determinization from automata to coalgebras
- Finitary Corecursion for the Infinitary Lambda Calculus
- Monads of coalgebras: rational terms and term graphs
- Real-Time Strict Deterministic Languages
- A Bialgebraic Review of Deterministic Automata, Regular Expressions and Languages
- Semantics of Higher-Order Recursion Schemes
This page was built for publication: A New Foundation for Finitary Corecursion
