Automatic programming: A tutorial on formal methodologies
From MaRDI portal
Publication:1060833
DOI10.1016/S0747-7171(85)80010-9zbMath0569.68010MaRDI QIDQ1060833
Publication date: 1985
Published in: Journal of Symbolic Computation (Search for Journal in Brave)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Top-down synthesis of divide-and-conquer algorithms
- On the inference of Turing machines from sample computations
- Synthesis: Dreams → Programs
- Use of a Nonprocedural Specification Language and Associated Program Generator in Software Development
- A Deductive Approach to Program Synthesis
- Pattern Recognition as Rule-Guided Inductive Inference
- Speeding up the Synthesis of Programs from Traces
- Proof Theory of Partial Correctness Verification Systems
- A Methodology for LISP Program Construction from Examples
- A Transformation System for Developing Recursive Programs
- Constructing Programs from Example Computations
- The Inference of Regular LISP Programs from Examples
- A Production Rule Mechanism for Generating LISP Code