A Tutorial on (Co)Algebras and (Co)Induction Export

@article{citeulike:405057, abstract = {. Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established importance in computer science. Formally, they are initial algebras. Induction is used both as a definition principle, and as a proof principle for such structures. But there are also important dual \"coalgebraic\" structures, which do not come equipped with constructor operations but with what are sometimes...}, author = {Jacobs, Bart and Rutten, Jan}, citeulike-article-id = {405057}, citeulike-linkout-0 = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1418}, journal = {Bulletin of the European Association for Theoretical Computer Science}, pages = {222--259}, posted-at = {2008-01-03 01:04:40}, priority = {2}, title = {A Tutorial on (Co)Algebras and (Co)Induction}, url = {http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1418}, volume = {62}, year = {1997} }

TY - JOUR ID - citeulike:405057 L3 - citeulike-article-id:405057 N2 - . Algebraic structures which are generated by a collection of constructors--- like natural numbers (generated by a zero and a successor) or finite lists and trees--- are of well-established importance in computer science. Formally, they are initial algebras. Induction is used both as a definition principle, and as a proof principle for such structures. But there are also important dual "coalgebraic" structures, which do not come equipped with constructor operations but with what are sometimes... JF - Bulletin of the European Association for Theoretical Computer Science EP - 259 TI - A Tutorial on (Co)Algebras and (Co)Induction VL - 62 SP - 222 AU - Jacobs, Bart AU - Rutten, Jan PY - 1997/// UR - http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.37.1418 ER -