Sciweavers

Share
IANDC
2010

A coinductive calculus of binary trees

8 years 5 months ago
A coinductive calculus of binary trees
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.
Alexandra Silva, Jan J. M. M. Rutten
Added 25 Jan 2011
Updated 25 Jan 2011
Type Journal
Year 2010
Where IANDC
Authors Alexandra Silva, Jan J. M. M. Rutten
Comments (0)
books