<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>17</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Sun Meng</style></author><author><style face="normal" font="default" size="100%">Luis Soares Barbosa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Components as coalgebras: The refinement dimension</style></title><secondary-title><style face="normal" font="default" size="100%">Theoretical Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2005</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/lsb/files/mb05_1.pdf</style></url></related-urls></urls><volume><style face="normal" font="default" size="100%">351</style></volume><pages><style face="normal" font="default" size="100%">276-294</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This paper characterizes refinement of state-based software components modeled as pointed coalgebras for some Set endofunctors. The proposed characterization is parametric on a specification of the underlying behaviour model introduced as astrong monad. This provides a basis to reason about (and transform) state-based software designs. In particular it is shown how refinement can be applied to the development of the inequational subset of a calculus of generic software components.&lt;/p&gt;
</style></abstract></record></records></xml>