摘要: This report presents the Galculator, a tool aimed at deriving equational proofs in arbitrary domains using Galois connections as fundamental concept. When combined with pointfree transform and indirect equality principle, offer very powerful, generic device to tackle complexity of program verification. We show how rewriting rules derived from properties are applied strategic term system which, current prototype, is implemented Haskell. The prospect integrating Galculator other proof assistants such eg. Coq also discussed.