Journal Article10.1145/321992.322002
A Methodology for LISP Program Construction from Examples
267
TL;DR: An automatic programming system, THESYS, for constructing recursive LISP programs from examples of what they do is described and equivalence between certain recurrence relations and various program schemata is proved.
read more
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.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Posted Content
Neural Architecture Search with Reinforcement Learning
Barret Zoph,Quoc V. Le +1 more
TL;DR: This paper uses a recurrent network to generate the model descriptions of neural networks and trains this RNN with reinforcement learning to maximize the expected accuracy of the generated architectures on a validation set.
5.5K
Syntax-guided synthesis
Rajeev Alur,Rastislav Bodik,Garvit Juniwal,Milo M. K. Martin,Mukund Raghothaman,Sanjit A. Seshia,Rishabh Singh,Emina Torlak,Abhishek Udupa,Armando Solar-Lezama +9 more
- 01 Oct 2013
TL;DR: This work describes three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, reports on prototype implementations, and presents experimental results on an initial set of benchmarks.
658
Oracle-guided component-based program synthesis
Susmit Jha,Sumit Gulwani,Sanjit A. Seshia,Ashish Tiwari +3 more
- 01 May 2010
TL;DR: A novel approach to automatic synthesis of loop-free programs based on a combination of oracle-guided learning from examples, and constraint-based synthesis from components using satisfiability modulo theories (SMT) solvers is presented.
Syntax-guided synthesis
Rajeev Alur,Rastislav Bodik,Garvit Juniwal,Milo M. K. Martin,Mukund Raghothaman,Sanjit A. Seshia,Rishabh Singh,Armando Solar-Lezama,Emina Torlak,Abhishek Udupa +9 more
- 11 Dec 2013
TL;DR: This work describes three different instantiations of the counter-example-guided-inductive-synthesis (CEGIS) strategy for solving the synthesis problem, reports on prototype implementations, and presents experimental results on an initial set of benchmarks.
Type-and-example-directed program synthesis
Peter-Michael Osera,Steve Zdancewic +1 more
- 03 Jun 2015
TL;DR: This paper presents an algorithm for synthesizing recursive functions that process algebraic datatypes that is founded on proof-theoretic techniques that exploit both type information and input–output examples to prune the search space.
References
•Book
LISP 1.5 Programmer's Manual
John J. McCarthy
- 01 Jan 1962
TL;DR: The LISP language is designed primarily for symbolic data processing used for symbolic calculations in differential and integral calculus, electrical circuit theory, mathematical logic, game playing, and other fields of artificial intelligence.
771
•Proceedings Article
Proving theorems about LISP functions
Robert S. Boyer,J. Strother Moore +1 more
- 20 Aug 1973
TL;DR: In this paper, the authors describe some simple heuristics combining evaluation and mathematical induction which are implemented in a program that automatically proves a wide variety of theorems about recursive LISP functions.
•Proceedings Article
Synthesis of LISP functions from examples
Steven Hardy
- 03 Sep 1975
TL;DR: A system, called GAP, which automatically produces LISP functions from example computations is described, which inductively infer the LISp function 'obviously' intended by a given 'iopair' (i.e. a single input to be presented to the function and the output which must result).
Progress report on program-understanding systems.
Cordell Green,Richard J. Waldinger,David R. Barstow,Robert A. Elschlager,Douglas B. Lenat,Brian P. McCune,David E. Shaw,Louis I. Steinberg +7 more
- 01 Aug 1974
TL;DR: This progress report covers the first year and one half of work by the automatic-programming research group at the Stanford Artificial Intelligence Laboratory on methods of program specification, codification of programming knowledge, and implementation of pilot systems for program writing and understanding.
36