A Mechanisation of Computability Theory in HOL (1996)
| Venue: | In Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics |
| Citations: | 1 - 1 self |
BibTeX
@INPROCEEDINGS{Zammit96amechanisation,
author = {Vincent Zammit},
title = {A Mechanisation of Computability Theory in HOL},
booktitle = {In Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics},
year = {1996},
pages = {431--446},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
. This paper describes a mechanisation of computability theory in HOL using the Unlimited Register Machine (URM) model of computation. The URM model is first specified as a rudimentary machine language and then the notion of a computable function is derived. This is followed by an illustration of the proof of a number of basic results of computability which include various closure properties of computable functions. These are used in the implementation of a mechanism which partly automates the proof of the computability of functions and a number of functions are then proved to be computable. This work forms part of a comparative study of different theorem proving approaches and a brief discussion regarding theorem proving in HOL follows the description of the mechanisation. 1 Introduction The theory of computation is a field which has been widely explored in mathematical and computer science literature [4, 12, 13] and several approaches to a standard model of computation h...
