The assignment consists of writing an extended abstract of the article.
We study the set TA of in?nite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive de?nition and proof principles based on the fact that TA carries a ?nal coalgebra structure.
By viewing trees as formal power series, we develop a calculus where de?nitions are presented as behavioural differential equations.
We present a general format for these equations that guarantees the existence and uniqueness of solutions.
Although technically not very dif?cult, the resulting framework has surprisingly nice applications, which is illustrated by various concrete examples.
Information and Computation
Article - A coinductive calculus of binary trees by Alexandra Silva, and Jan Rutten
Attachment:- silvarutten calculus trees.pdf