We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on the fact that TA carries a final coalgebra structure. By viewing trees as formal power series, we develop a calculus where definitions 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 difficult, the resulting framework has surprisingly nice applications, which is illustrated by various concrete examples.
, , , ,
, ,
, ,
Software Engineering [SEN]
Computer Security

Silva, A.M, & Rutten, J.J.M.M. (2007). Behavioural differential equations and coinduction for binary trees. Software Engineering [SEN]. CWI.