{"type":"ScholarlyArticle","title":"Proving Theorems about LISP Functions","authors":[{"name":"Robert S. Boyer","slug":"robert-s-boyer","given":"Robert S.","family":"Boyer","affiliation":""},{"name":"J. Strother Moore","slug":"j-strother-moore","given":"J. Strother","family":"Moore","affiliation":""}],"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.","doi":null,"url":"https://ijcai.org/proceedings/1973/62","pdf":"https://ijcai.org/proceedings/1973/0062.pdf","markdown":"https://ijcai.org/proceedings/1973/62.md","bibtex":"https://ijcai.org/proceedings/1973/bibtex/62","volume":{"slug":"1973","title":"Proceedings of the Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 1973","url":"https://ijcai.org/proceedings/1973/","year":1973,"location":"Stanford, California, USA","dates":"20-23 August 1973","editors":"Nils J. Nilsson","isbn":"","publisher":"International Joint Conferences on Artificial Intelligence","doi_prefix":""},"section":"Automatic Programming","track":"Automatic Programming","number":62,"pages":{"first":486,"last":492},"keywords":[],"videos":[],"references":[],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}