Hemer, D.Hayes, I.Strooper, P.2007-07-052007-07-052001Lecture Notes in Artificial Intelligence, 2001; 2152:249-2640302-9743http://hdl.handle.net/2440/33981The original publication can be found at www.springerlink.comThis paper describes a deep embedding of a refinement calculus for logic programs in Isabelle/HOL. It extends a previous tool with support for procedures and recursion. The tool supports refinement in context, and a number of window-inference tactics that ease the burden on the user. In this paper, we also discuss the insights gained into the suitability of different logics for embedding refinement calculii (applicable to both declarative and imperative paradigms). In particular, we discuss the richness of the language, choice between typed and untyped logics, automated proof support, support for user-defined tactics, and representation of program states.enJournal article002006428410.1007/3-540-44755-5_1850405