Automatic Programming From Data Types Decomposition Patterns
Proceedings of the Eighth International Joint Conference on Artificial Intelligence. Automatic Programming. Pages 37-38.
Abstract
A running system is presented which provides powerful support to the user while designing programs. This system automatically constructs program schemas by decomposition of the datas involved in the specification. Datas are specified within a knowledge-base as data types having associated decomposition patterns. The use 'r may combine different data-decomposition strategies with any of its decomposition patterns. So it is possible to build several program schemas for the same problem. Once a program schema is built the user can instantiate or adapt it by hand. He can also apply the system repetitively until he obtains primitive problems which can be solved directly.
@inproceedings{ijcai1983p8,
title = {Automatic Programming From Data Types Decomposition Patterns},
author = {Gresse, Christian},
booktitle = {Proceedings of the Eighth International Joint Conference on
Artificial Intelligence, {IJCAI-83}},
publisher = {International Joint Conferences on Artificial Intelligence},
editor = {Alan Bundy},
pages = {37--38},
year = {1983},
note = {Automatic Programming},
url = {https://ijcai.org/proceedings/1983/8},
}
TY - CPAPER TI - Automatic Programming From Data Types Decomposition Patterns AU - Gresse, Christian T2 - Proceedings of the Eighth International Joint Conference on Artificial Intelligence, IJCAI-83 PB - International Joint Conferences on Artificial Intelligence PY - 1983 SP - 37 EP - 38 UR - https://ijcai.org/proceedings/1983/8 ER -Copied
Machine-readable versions of this paper, for tools and AI agents:
