Automatic Programming Using Abstract Data Types
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 1-8.
Abstract
In this paper we first try to characterize one meaning of automatic programming. We consider it to be one part of the Progranming environment related to Artificial Intelligence techniques. We then illustrate an automatic progranming process, on a simple example, using an Abstract Data Type theory to .hl.ch ~add the rot ion aE schemes which are particularly useful in program derivation from Abstract Type decomposition. We conclude that all the concepts treated in this paper must be contained in one way or another in any automatic prcbramming system. However this necessitates further study in such theoretical fields as Abstract Data Type Theory, Specification languages, Theorem provers or proof cheekers and rule rewriting systems.
@inproceedings{ijcai1983p1,
title = {Automatic Programming Using Abstract Data Types},
author = {Guiho, Gérard D.},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {1--8},
year = {1983},
note = {Automatic Programming},
url = {https://ijcai.org/proceedings/1983/1},
}
TY - CPAPER TI - Automatic Programming Using Abstract Data Types AU - Guiho, Gérard D. T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 1 EP - 8 UR - https://ijcai.org/proceedings/1983/1 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
