Proceedings

Proving Theorems about LISP Functions

Download BibTeX Cite

Proceedings of the Third International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 486-492.

Abstract

e desc r ibe some simple heu ri stics combining evaluatio n and mathematical induction which we have implemented in a program that a utomatically proves a wide va riety of theorems a bout recursive LISP functions . The method the program uses to gene r ate induction formulas is described at l ength . The theorems proved by the progr am include that REVERSE is its own inverse and that a pa rti c ular SORT program is correct . Appendix B contains a list of the t he orems proved by the program.

Robert S. Boyer, and J. Strother Moore. 1973. Proving Theorems about LISP Functions. In Proceedings of the Third International Joint Conference on Artificial Intelligence, IJCAI-73. IJCAI, 486–492. https://ijcai.org/proceedings/1973/62
Welcome Future Conferences AI Journal Division IJCAI Proceedings About IJCAI IJCAI Awards