A Methodology for LISP Program Construction from Examples
From MaRDI portal
Publication:4111079
DOI10.1145/321992.322002zbMath0343.68013OpenAlexW2076242896MaRDI QIDQ4111079
Publication date: 1977
Published in: Journal of the ACM (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/321992.322002
Symbolic computation and algebraic computation (68W30) General topics in the theory of software (68N01)
Related Items
Unnamed Item ⋮ Counterexample-guided partial bounding for recursive function synthesis ⋮ Inductive synthesis of term rewriting systems ⋮ A theory of formal synthesis via inductive learning ⋮ Schema induction for logic program synthesis ⋮ From programming-by-example to proving-by-example ⋮ Drill and Join: A Method for Exact Inductive Program Synthesis ⋮ Learning efficient logic programs ⋮ Genetic programming \(+\) proof search \(=\) automatic improvement ⋮ A class of functions synthesized from a finite number of examples and a lisp program scheme ⋮ A knowledge-based approach to program synthesis from examples ⋮ Analytical Inductive Functional Programming ⋮ Synthesis of rewrite programs by higher-order and semantic unification ⋮ Automatic insertion of indexing instructions in program synthesis ⋮ Synthetic programming ⋮ Generalized regular expressions - a language for synthesis of programs with branching in loops ⋮ An abstract formalization of correct schemas for program synthesis ⋮ Automatic programming: A tutorial on formal methodologies ⋮ Inducing Constructor Systems from Example-Terms by Detecting Syntactical Regularities ⋮ Logic program synthesis from incomplete specifications
