<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Paulo Silva</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%">Report on the Design of a Galculator</style></title></titles><dates><year><style  face="normal" font="default" size="100%">2008</style></year></dates><urls><related-urls><url><style face="normal" font="default" size="100%">https://haslab.uminho.pt/sites/default/files/pfsilva/files/techicalreport-fast-08-01.pdf</style></url></related-urls></urls><number><style face="normal" font="default" size="100%">FAST:08.01</style></number><publisher><style face="normal" font="default" size="100%">CCTC, Departamento de Informática, Universidade do Minho</style></publisher><language><style face="normal" font="default" size="100%">eng</style></language><abstract><style face="normal" font="default" size="100%">&lt;p&gt;This report presents the Galculator, a tool aimed at deriving equational proofs in arbitrary domains using Galois connections as the fundamental concept. When combined with the pointfree transform and the indirect equality principle, Galois connections offer a very powerful, generic device to tackle the complexity of proofs in program verification.&lt;/p&gt;
&lt;p&gt;We show how rewriting rules derived from the properties of the Galois connections are applied in proofs using a strategic term rewriting system which, in the current prototype, is implemented in Haskell. The prospect of integrating the Galculator with other proof assistants such as e.g. Coq is also discussed.&lt;/p&gt;
</style></abstract></record></records></xml>