Automatic programming from data types decomposition patterns

Authors:
Christian Gresse
Affiliations:
Universite Paris-Sud, Orsay Cedex, France
Venue:
IJCAI'83 Proceedings of the Eighth international joint conference on Artificial intelligence - Volume 1
Year:
1983

Citing 3
Cited 0

A Deductive Approach to Program Synthesis

ACM Transactions on Programming Languages and Systems (TOPLAS)
An Expert System for Implementing Abstract Sorting Algorithms on Parameterized Abstract Data Types

GWAI '81 Proceedings of the German Workshop on Artificial Intelligence
The Programmer's Apprentice: Knowledge Based Program Editing

IEEE Transactions on Software Engineering

Quantified Score

Hi-index	0.00

Visualization

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 with in 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.