## A HOL Basis for Reasoning about Functional Programs (1994)

Citations: | 23 - 6 self |

### BibTeX

@TECHREPORT{Agerholm94ahol,

author = {Sten Agerholm and Sten Agerholm and Ny Munkegade},

title = {A HOL Basis for Reasoning about Functional Programs},

institution = {},

year = {1994}

}

### OpenURL

### Abstract

he long-standing and important problem of defining non-primitive recursive functions in the HOL system. Our philosophy is that there must be a direct correspondence between elements of complete partial orders (domains) and elements of HOL types, in order to allow the reuse of higher order logic and proof infrastructure already available in the HOL system. Hence, we are able to mix domain theoretic reasoning with reasoning in the set theoretic HOL world to advantage, exploiting HOL types and tools directly. Moreover, by mixing domain and set theoretic reasoning, we are able to eliminate almost all reasoning about the bottom element of complete partial orders that makes the LCF theorem prover, which supports a first order logic of domain theory, difficult and tedious to use. A thorough comparison with LCF is provided. The advantages of combining the best of the domain and set theoretic worlds in the same system are demonstrated in a larger example, showing the correctness of a unificat