Constructive Rewriting
Published in The Computer Journal • Jan 1, 1991
NobleIDNI8P43W94R77S75
Authors:
Tobias Nipkow
Abstract
The subject of this paper is rewriting in an LCF-like general theorem proving framework. It is shown how rewriting of both terms and formulae can be implemented by simple tactics in the generic theorem prover Isabelle. These tactics can easily be combined with induction to yield powerful theorem pro...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!