META-INTERPRETATION OF RECURSIVE LIST-PROCESSING PROGRAMS

Goossens, Daniel

META-INTERPRETATION OF RECURSIVE LIST-PROCESSING PROGRAMS

Download BibTeX Cite

Proceedings of the Sixth International Joint Conference on Artificial Intelligence. .

Abstract

Presented is an implemented program understanding system called CAN. CAN relies on a meta-interpretation process uhich brings to light tuo neu concepts concerning meta-interpretation of recursive programs: vicious circles and constructive i nduction. These notions express CAN's ability to extract from program code classes of data for uhich interpretation of the code uould not stop, and in general, to relate classes of data uith abstract values and environments.

Daniel Goossens. 1979. META-INTERPRETATION OF RECURSIVE LIST-PROCESSING PROGRAMS. In Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79. IJCAI, https://ijcai.org/proceedings/1979/237

@inproceedings{ijcai1979p237,
  title     = {META-INTERPRETATION OF RECURSIVE LIST-PROCESSING PROGRAMS},
  author    = {Goossens, Daniel},
  booktitle = {Proceedings of the Sixth International Joint Conference on
               Artificial Intelligence, {IJCAI-79}},
  publisher = {International Joint Conferences on Artificial Intelligence},
  editor    = {Bruce G. Buchanan},
  year      = {1979},
  month     = {8},
  url       = {https://ijcai.org/proceedings/1979/237},
}

TY  - CPAPER
TI  - META-INTERPRETATION OF RECURSIVE LIST-PROCESSING PROGRAMS
AU  - Goossens, Daniel
T2  - Proceedings of the Sixth International Joint Conference on Artificial Intelligence, IJCAI-79
PB  - International Joint Conferences on Artificial Intelligence
PY  - 1979
UR  - https://ijcai.org/proceedings/1979/237
ER  -