A Formal Representation For Plans In The Programmer's Apprentice This chapter describes research done at the Artificial Intelligence Laboratory of the Massachusetts Institute of Technology. Support for the laboratory's artificial intelligence research has been provided in part by the Advanced Research Projects Agency of the Department of Defense under Office of Naval Research contracts N00014-75-C-0643 and N00014-80-C-0505, and in part by National Science Foundation grant MCS-7912179. The views and conclusions contained in this chapter are those of the author, and should not be interpreted as necessarily representing the official policies, either expressed or implied, of the Department of Defense, the National Science Foundation, or the United States Government. This chapter is reprinted with permission from the Proceedings of the Seventh International Joint Conference on Artificial Intelligence, Vancouver, BC, Canada, August 24-28, 1981.
Reference42 articles.
1. “Transformational Implementation: An Example”;Balzer;IEEE Trans. on Software Eng.,1981
2. D.R. Barstow, “Automatic Construction of Algorithms and Data Structures Using A Knowledge Base of Programming Rules”, Stanford AIM-308, Nov. 1977.
3. “A Transformation System for Developing Recursive Programs”;Burstall;J. of the ACM,1977
4. S. Basu and J. Misra, “Some Classes of Naturally Provable Programs”, 2nd Int. Conf. on Software Eng., San Francisco, Cal., Oct., 1976.
5. “Program Development as a Formal Activity”;Broy;IEEE Trans. on Software Eng.,1980