论文信息 - Inducing Non-Trivial Programs from Examples - 字舞流文

Inducing Non-Trivial Programs from Examples

This paper describes the synthesis of functions from input-output examples. The synthesis is achieved by transforming the examples into computation traces and finding recurrent relations between these traces.

Eric Papon | E. Papon

[1] Yves Kodratoff,et al. A system for for program synthesis and program optimization , 1980 .

[2] John McCarthy,et al. Towards a Mathematical Science of Computation , 1962, IFIP Congress.

[3] Phillip D. Summers,et al. A Methodology for LISP Program Construction from Examples , 1977, J. ACM.

[4] John Darlington,et al. A Transformation System for Developing Recursive Programs , 1977, J. ACM.

[5] J. A. Robinson,et al. A Machine-Oriented Logic Based on the Resolution Principle , 1965, JACM.

[6] Alan W. Biermann,et al. The Hierarchical Synthesis of Lisp Scanning Programs , 1977, IFIP Congress.

[7] Zohar Manna,et al. Inductive methods for proving properties of programs , 1973, Commun. ACM.

[8] P. H. Lindsay. Human Information Processing , 1977 .