Another recursion induction principle
Communications of the ACM
Implementation and applications of Scott's logic for computable functions
Proceedings of ACM conference on Proving assertions about programs
Inductive methods for proving properties of programs
Proceedings of ACM conference on Proving assertions about programs
Recursive definitions of partial functions and their computations
Recursive definitions of partial functions and their computations
Proof-techniques for recursive programs.
Proof-techniques for recursive programs.
| Hi-index | 0.00 |
This note is actually an informal exposition of a part of a recent paper by Manna, Ness and Vuillemin. We have two main purposes in this note. First, we present some known results about computation of recursive programs, emphasizing some differences between the theoretical and practical approaches. Second, we introduce the computational induction method for proving properties of recursive programs. It turns out that most known methods for proving properties of programs are very closely related to the computational induction method. We illustrate this point by showing how Floyd's inductive assertions method for proving properties of "flowchart programs" can be expressed in terms of computational induction on recursive programs.