Higher-Order Logic and Theorem Proving for Structured Specifications [chapter]

Tomasz Borzyszkowski
2000 Lecture Notes in Computer Science  
In this paper we present the higher-order logic used in theorem-provers like the HOL system (see [GM 93]) or Isabelle HOL logic (see [Paul 94]) as an institution. Then we show that for maps of institutions into HOL that satisfy certain technical conditions we can reuse the proof system of the higher-order logic to reason about structured specifications built over the institutions mapped into HOL. We also show some maps of institutions underlying the CASL specification formalism (see [CASL 99])
more » ... nto HOL that satisfy conditions needed for reusing proof systems. This research was partially supported by ESPRIT CRIT2 program, working group 29432 (CoFI WG) and KBN grant 8 T11C 037 16. Proof. By induction on the structure of κ.
doi:10.1007/978-3-540-44616-3_23 fatcat:3dfhrzw3wvgpxjbob3masrh54y