Actor induction and meta-evaluation
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Expressiveness of the operation set of a data abstraction
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
A universal modular ACTOR formalism for artificial intelligence
IJCAI'73 Proceedings of the 3rd international joint conference on Artificial intelligence
| Hi-index | 0.00 |
Four methods for proving equivalence of programs y induction are described and compared. They are recursion induction, structural induction, mu-rule induction, and truncation induction. McCarthy''s formalism for conditional expressions as function definitions is used and reinterpreted in view of Park''s work on results in lattice theory as related to proofs about programs. The possible application of this work to automatic program verification is commented upon.