Automatic Programming from Data Types Decomposition Patterns
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 user 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. Key-words: Running system. Data types. Decomposition patterns. Powerful support. Progam schema. Strategies of decomposition. I
Cite
Text
Gresse. "Automatic Programming from Data Types Decomposition Patterns." International Joint Conference on Artificial Intelligence, 1983.Markdown
[Gresse. "Automatic Programming from Data Types Decomposition Patterns." International Joint Conference on Artificial Intelligence, 1983.](https://mlanthology.org/ijcai/1983/gresse1983ijcai-automatic/)BibTeX
@inproceedings{gresse1983ijcai-automatic,
title = {{Automatic Programming from Data Types Decomposition Patterns}},
author = {Gresse, Christian},
booktitle = {International Joint Conference on Artificial Intelligence},
year = {1983},
pages = {37-39},
url = {https://mlanthology.org/ijcai/1983/gresse1983ijcai-automatic/}
}