HOLCF: Higher Order Logic of Computable Functions (1995)
Cached
Download Links
| Venue: | In Theorem Proving in Higher Order Logics, volume 971 of LNCS |
| Citations: | 22 - 0 self |
BibTeX
@INPROCEEDINGS{Regensburger95holcf:higher,
author = {Franz Regensburger},
title = {HOLCF: Higher Order Logic of Computable Functions},
booktitle = {In Theorem Proving in Higher Order Logics, volume 971 of LNCS},
year = {1995},
pages = {293--307},
publisher = {Springer-Verlag}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL, which offers the additional concept of type classes. HOLCF extends HOLC with concepts of domain theory such as complete partial orders, continuous functions and a fixed point operator. With the help of type classes the extension can be formulated in a way such that the logic LCF constitutes a proper sublanguage of HOLCF. Therefore techniques from higher order logic and LCF can be combined in a fruitful manner avoiding drawbacks of both logics. The development of HOLCF was entirely conducted within the Isabelle system. 1 Introduction This paper presents a survey of HOLCF, a higher order logic of computable functions. The logic HOLCF is based on HOLC, a variant of the well known higher order logic HOL [GM93], which offers the additional concept of type classes. HOLCF extends HOLC with concepts of domain t...
