A deductive approach to program synthesis
Abstract/Contents
- Abstract
- Program synthesis is the systematic derivation of a program from a given specification. A deductive approach to program synthesis is presented for the construction of recursive programs. This approach regards program synthesis as a theorem-proving task and relies on a theorem-proving method that combines the features of transformation rules, unification, and mathematical induction within a single framework.
Description
| Type of resource | text |
|---|---|
| Form | technical reports |
| Extent | 1 text file |
| Place | Stanford (Calif.) |
| Date created | November 1, 1978 |
| Language | English |
| Digital origin | reformatted digital |
Creators/Contributors
| Author | Manna, Zohar |
|---|---|
| Author | Waldinger, Richard J. |
Subjects
| Subject | Stanford University. Computer Science Department |
|---|---|
| Subject | Computer science |
| Genre | Technical reports |
Bibliographic information
| Finding Aid | |
|---|---|
| Technical Report # | CS-TR-1978-690 |
| Location | https://purl.stanford.edu/pb593mh9420 |
| Location | 3840/2 |
| Repository | Stanford University. Libraries. Department of Special Collections and University Archives |
Access conditions
- Use and reproduction
- The materials are open for research use and may be used freely for non-commercial purposes with an attribution. For commercial permission requests, please contact the Stanford University Archives (universityarchives@stanford.edu).
Collection
Stanford University, Department of Computer Science, Technical Reports
View other items in this collection in SearchWorksStanford Artificial Intelligence Laboratory records, 1963-2009
View other items in this collection in SearchWorksAlso listed in
Loading usage metrics...