<?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%">Luis Soares Barbosa</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Towards a Calculus of State-based Software Components</style></title><secondary-title><style face="normal" font="default" size="100%">Journal of Universal Computer Science</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2003</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/lsb/files/barbosa_l_s.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">8</style></number><volume><style face="normal" font="default" size="100%">9</style></volume><pages><style face="normal" font="default" size="100%">891-909</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 introduces a calculus of state_based software components modelled as concrete coalgebras for some Set endofunctors, with specified initial conditions. The calculus is parametrized by a notion of behaviour, introduced as a strong (usually commutative) monad. The proposed component model and calculus are illustrated through the characterisation of a particular class of components, classified as separable, which includes the ones arising in the so-called model oriented approach to systems design.&lt;/p&gt;
</style></abstract></record></records></xml>