<?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%">José Nuno Oliveira</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">A relation-algebraic approach to the 'Hoare logic' of functional dependencies</style></title><secondary-title><style face="normal" font="default" size="100%">JLAP - The Journal of Logic and Algebraic Programming</style></secondary-title></titles><dates><year><style  face="normal" font="default" size="100%">2014</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/jno/files/1-s2.0-s1567832614000149-main.pdf</style></url></related-urls></urls><publisher><style face="normal" font="default" size="100%">Elsevier, North-Holland</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;Abstract algebra has the power to unify seemingly disparate theories once they are encoded into the same abstract formalism. This paper shows how a relation-algebraic rendering of both database dependency theory and Hoare programming logic purports one such unification, in spite of the latter being an algorithmic theory and the former a data theory. The approach equips relational data with \emph{functional types} and an associated type system which is useful for database operation type checking and optimization. The prospect of a generic, unified approach to both programming and data theories on top of libraries already available in automated deduction systems is envisaged.&lt;/p&gt;
</style></abstract></record></records></xml>