Meta-Interpretation of Recursive List-Processing Programs
Abstract
Presented Is an implemented program understanding system called CAN. CAN relies on a meta-interpretation process which brings to light two new concepts concerning meta-interpretation of recursive programs: vicious circles and constructive induction. These notions express CAN's ability to extract from program code classes of data for which Interpretation of the code would not stop, and in general, to relate classes of data with abstract values and environments.
Cite
Text
Goossens. "Meta-Interpretation of Recursive List-Processing Programs." International Joint Conference on Artificial Intelligence, 1979.Markdown
[Goossens. "Meta-Interpretation of Recursive List-Processing Programs." International Joint Conference on Artificial Intelligence, 1979.](https://mlanthology.org/ijcai/1979/goossens1979ijcai-meta/)BibTeX
@inproceedings{goossens1979ijcai-meta,
title = {{Meta-Interpretation of Recursive List-Processing Programs}},
author = {Goossens, Daniel},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1979},
pages = {338},
url = {https://mlanthology.org/ijcai/1979/goossens1979ijcai-meta/}
}