Phillip D. Summers
Abstract
An automatic programming system, THESYS, for constructing recursive LISP programs from examples of what they do is described. The construction methodology is illustrated as a series of transformations from the set of examples to a program satisfying the examples. The transformations consist of (1) deriving the specific computation associated with a specific example, (2) deriving control flow predicates, and (3) deriving an equivalent program specification in the form of recurrence relations. Equivalence between certain recurrence relations and various program schemata is proved. A detailed description of the construction of four programs is presented to illustrate the application of the methodology.
- 1 BIERMANN, A W , ANt) Ka~SnNASWA~,tV, R Constructing programs from example computations. Rep OSU-CISRC-TR-74-5, Comptr and Inform Sc~ Res Ctr, The Ohio State U , Columbus, Ohio, 1974Google Scholar
- 2 BLtJM, L, AND BLUM, M Toward a mathematical theory of mductwe mference Inform and Control28 (1975), 125-155Google Scholar
- 3 BORER, R S , AND MOORE, JS Proving theorems about LISP programs J ACM 22, I (Jan 1975), I29- 144 Google Scholar
- 4 GREEN, C C, ET AL Progress report on program understanding systems Rep STAN-CS-74-444, Comptr Scl Dep , Stanford U , Stanford, Calf, 1974 Google Scholar
- 5 HARDY, S Synthesis of LISP functions from examples Proc lnt Joint Conf on Artlf Intel , 1975, pp 240-245Google Scholar
- 6 KUJEL, P A theorem about automatic programming SIGART Newsletter (ACM) 51 (Aprd 1975), 5-8 Google Scholar
- 7 MCCARTHY, J , El" AL LISP 1 5 Programmer's Manual M I T Press, Cambrtdge, Mass., 1962 Google Scholar
- 8 MOOI~E, JS Introducing PROG into the pure LISP theorem prover. Rep CSL-74-3, Xerox Palo Alto Res Ctr, Palo Alto, Calf, 1974Google Scholar
- 9 SHAW, D E, ET AL Inferrmg LISP programs from examples Private commumcatlon, 1974Google Scholar
- 10 SIKLOSSV, L The synthesis of programs from their properties and the insane heunsUc Proc Third Texas Conf on Comptr Syst , Austin, Tex , 1974, paper 5-2Google Scholar
- 11 SUMMERS, P D Program construction from examples Ph D Th, Dep Comptr Scl, Yale U, New Haven, Conn , 1975 Google Scholar
- 12 WALDINGER, R J Constructing programs automatically using theorem proving Ph D Th, Dep Comptr Scl , Carnegie-Mellon U., Pittsburgh, Pa , 1969Google Scholar
Index Terms
- A Methodology for LISP Program Construction from Examples
Recommendations
A methodology for LISP program construction from examples
POPL '76: Proceedings of the 3rd ACM SIGACT-SIGPLAN symposium on Principles on programming languagesThis paper reports on a system, THESYS, that synthesizes LISP recursive programs from examples of what they do. There has been recent interest in this form of program specification[1,4,8]. The theory of such inductive systems has been investigated by ...
New examples of Krall–Meixner and Krall–Hahn polynomials, with applications to the construction of exceptional Meixner and Laguerre polynomials
AbstractWe construct new examples of Krall discrete orthogonal polynomials, i.e., orthogonal polynomials with respect to a measure which are also eigenfunctions of a higher order difference operator. The new examples include the orthogonal ...
Archetype modeling methodology
Graphical abstractDisplay Omitted
Highlights- An archetype modeling methodology is proposed.
- Composed by 5 phases: analysis, ...
AbstractClinical Information Models (CIMs) expressed as archetypes play an essential role in the design and development of current Electronic Health Record (EHR) information structures. Although there exist many experiences about using ...
Comments