Defining Recursive Functions In HOL

Abstract

The limited support for defining recursive functions and generating induction schemes is a major shortcoming of the HOL system. In this paper, a theory of primitive recursive functions and a tool that minimizes the proof effort required for the definition of a wide class of primitive recursive functions are presented. Due to its jlezibility and degree of automation, this work offers a useful eztension of the HOL system.