## A Theorem Prover for a Computational Logic (1990)

### Cached

### Download Links

- [ftp.cs.utexas.edu]
- [dirleton.csres.utexas.edu]
- DBLP

### Other Repositories/Bibliography

Citations: | 24 - 0 self |

### BibTeX

@MISC{Boyer90atheorem,

author = {Robert S. Boyer and J Strother Moore},

title = {A Theorem Prover for a Computational Logic},

year = {1990}

}

### OpenURL

### Abstract

We briefly review a mechanical theorem-prover for a logic of recursive functions over finitely generated objects including the integers, ordered pairs, and symbols. The prover, known both as NQTHM and as the Boyer-Moore prover, contains a mechanized principle of induction and implementations of linear resolution, rewriting, and arithmetic decision procedures. We describe some applications of the prover, including a proof of the correct implementation of a higher level language on a microprocessor defined at the gate level. We also describe the ongoing project of recoding the entire prover as an applicative function within its own logic.