<?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><author><style face="normal" font="default" size="100%">José Nuno Oliveira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">State-based Components Made Generic</style></title><secondary-title><style face="normal" font="default" size="100%">Electronic Notes in Theoretical 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/1-s2.0-s1571066104806315-main.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">1</style></number><publisher><style face="normal" font="default" size="100%">Elsevier</style></publisher><volume><style face="normal" font="default" size="100%">82</style></volume><pages><style face="normal" font="default" size="100%">39-56</style></pages><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Genericity is a topic which is not sufficiently developed in state-based systems modelling, mainly due to a myriad of approaches and behaviour models which lack unification. This paper adopts coalgebra theory to propose a generic notion of a state-based software component, and an associated calculus, by quantifying over behavioural models specified as strong monads. This leads to the pointfree, calculational reasoning style which is typical of the so-called Bird-Meertens school.&lt;/p&gt;
</style></abstract></record></records></xml>