Higher-Order Logic and Theorem Proving for Structured Specifications (1999)
Cached
Download Links
- [ftp.ipipan.gda.pl]
- [delta.math.univ.gda.pl]
- DBLP
Other Repositories/Bibliography
| Venue: | in Algebraic Development Techniques, (WADT 99), LNCS |
| Citations: | 11 - 0 self |
BibTeX
@INPROCEEDINGS{Borzyszkowski99higher-orderlogic,
author = {Tomasz Borzyszkowski},
title = {Higher-Order Logic and Theorem Proving for Structured Specifications},
booktitle = {in Algebraic Development Techniques, (WADT 99), LNCS},
year = {1999},
pages = {401--418},
publisher = {Springer}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
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]) into HOL that satisfy conditions needed for reusing proof systems.
Citations
| 996 | The Lambda Calculus, Its Syntax and Semantics - Barendregt - 1984 |
| 425 | Institutions: Abstract model theory for specification and programming - Goguen, Burstall - 1992 |
| 279 | An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof - Andrews - 1986 |
| 134 | Toward formal development of programs from algebraic specification revisited - Sanella, Tarlecki - 1988 |
| 133 | Isabelle: A Generic Theorem - Paulson - 1994 |
| 103 | Introduction to HOL - Gordon, Melham - 1993 |
| 21 | Static semantic analysis and theorem proving for Casl - Mossakowski, Kolyang, et al. - 1997 |
| 1 | Soko lowski, A. Tarlecki. Towards formal development of programs from algebraic speci parameterization revisited - Sannella, S - 1992 |
