NDLI: The automatic synthesis of recursive programs

Please wait, while we are loading the content...

Automatic synthesis of optimal invariant assertions: Mathematical foundations

Abstractions, instantiations, and proofs of marking algorithms

Program synthesis by analogy

The automatic synthesis of recursive programs

Control requirements for the design of production system architectures

Generalized procedure calling and content-directed invocation

The incremental garbage collection of processes

Macaroni is better than spaghetti

Design rationale for TELOS, a PASCAL-based AI language

Automated derivation of program control structure from natural language program descriptions

What the nature of natural language tells us about how to make natural-language-like programming languages more natural

Language facilities for programmable backtracking

CSSA: Language concepts and programming methodology

Prolog - the language and its implementation compared with Lisp

AMORD explicit control of reasoning

A knowledge-based code generator generator

The PSI Program Model Builder - synthesis of very high-level programs

The selection of efficient implementations for a high-level language

Selection of representations for data structures

A normal form for compiler testing

Program manipulation via an efficient production system

Self-redefinition as a program manipulation strategy

The automatic synthesis of recursive programs

Content Provider	ACM Digital Library
Author	Manna, Zohar Waldinger, Richard
Abstract	We describe a deductive technique for the automatic construction of recursive programs to meet given input-output specifications. These specifications express what conditions the output of the desired program is expected to satisfy. The deductive technique involves transforming the specifications by a collection of rules, summoned by pattern-directed function invocation. Some of these transformation rules express the semantics of the subject domain; others represent more general programming techniques. The rules that introduce conditional expressions and recursive calls into the program are discussed in some detail. The deductive techniques described are embedded in a running system called SYNSYS. This system accepts specifications expressed in high-level descriptive language and attempts to transform them into a corresponding LISP program. The transformation rules are expressed in the QLISP programming language. The synthesis of two programs performed by the system are presented. This research was supported in part by the Advanced Research Projects Agency of the Department of Defense under Contract MDA903-76-C-0206, by the National Science Foundation under Grant DCR72-03737 A01, by the Office of Naval Research under Contracts N00014-76-C-0687 and N00014-75-C-0816; and by a grant from the United States-Israel Binational Science Foundation (BSF), Jerusalem, Israel. The views and conclusions contained in this document are those of the authors and should not be interpreted as necessarily representing the official policies, either expressed or implied, of Stanford University, Stanford Research Institute, or the U.S. Government. .
Starting Page	29
Ending Page	36
Page Count	8
File Format	PDF
DOI	10.1145/800228.806929
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1977-08-15
Publisher Place	New York
Access Restriction	Subscribed
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (1999)

Automatic synthesis of recursive programs: the proof-planning paradigm

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (1997)

The automatic synthesis of recursive programs (SGAR, Issue. 64)

Automatic synthesis of recursive programs: the proof-planning paradigm (1997).

Inductive synthesis of recursive functional programs (poster abstract)

Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (1992)

The Automatic Debugging of Recursive Side-effecting Programs

Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (1992)

The automatic synthesis of recursive programs

Similar Documents

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (1999)

Automatic synthesis of recursive programs: the proof-planning paradigm

Automatic Synthesis of Recursive Programs: The Proof-Planning Paradigm (1997)

The automatic synthesis of recursive programs (SGAR, Issue. 64)

Automatic synthesis of recursive programs: the proof-planning paradigm (1997).

Inductive synthesis of recursive functional programs (poster abstract)

Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (1992)

The Automatic Debugging of Recursive Side-effecting Programs

Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (1992)

The automatic synthesis of recursive programs