Program Understanding with the Lambda Calculus
Proceedings of the Tenth International Joint Conference on Artificial Intelligence. Knowledge Representation. Pages 512-513.
Abstract
A prerequisite of any attempt to build intelligent tools to assist in the programming process is a representation language for encoding programming knowledge. Languages that have been used for this purpose include the predicate calculus [5] and various program-schema languages [1,4]. This paper advocates a new candidate which is as expressive as the predicate calculus but more intimately connected with programming: the lambda calculus. Its advantages lie in its close resemblance to conventional programming languages, and in a straighforward model of inference by rewriting, which can be applied to automatic programming and program understanding. The use of the lambda calculus in an automatic program understander is described.
@inproceedings{ijcai1987p101,
title = {Program Understanding with the Lambda Calculus},
author = {Letovsky, Stanley},
booktitle = {Proceedings of the Tenth International Joint Conference on
Artificial Intelligence, {IJCAI-87}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {John McDermott},
pages = {512--513},
year = {1987},
note = {Knowledge Representation},
url = {https://ijcai.org/proceedings/1987/101},
}
TY - CPAPER TI - Program Understanding with the Lambda Calculus AU - Letovsky, Stanley T2 - Proceedings of the Tenth International Joint Conference on Artificial Intelligence, IJCAI-87 PB - International Joint Conferences on Artificial Intelligence PY - 1987 SP - 512 EP - 513 UR - https://ijcai.org/proceedings/1987/101 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
