ML Anthology

Program Understanding with the Lambda Calculus

Stanley Letovsky
IJCAI 1987 pp. 512-514
/ijcai/1987/letovsky1987ijcai-program/

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 w i th 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.

PDF Semantic Scholar

Cite

Text

Letovsky. "Program Understanding with the Lambda Calculus." International Joint Conference on Artificial Intelligence, 1987.

Markdown

[Letovsky. "Program Understanding with the Lambda Calculus." International Joint Conference on Artificial Intelligence, 1987.](https://mlanthology.org/ijcai/1987/letovsky1987ijcai-program/)

BibTeX

@inproceedings{letovsky1987ijcai-program,
  title     = {{Program Understanding with the Lambda Calculus}},
  author    = {Letovsky, Stanley},
  booktitle = {International Joint Conference on Artificial Intelligence},
  year      = {1987},
  pages     = {512-514},
  url       = {https://mlanthology.org/ijcai/1987/letovsky1987ijcai-program/}
}