A Methodology for LISP Program Construction from Examples
From MaRDI portal
Cited in
(23)- Automatic programming: A tutorial on formal methodologies
- Schema induction for logic program synthesis
- Logic program synthesis from incomplete specifications
- An abstract formalization of correct schemas for program synthesis
- A theory of formal synthesis via inductive learning
- Generalized regular expressions - a language for synthesis of programs with branching in loops
- A knowledge-based approach to program synthesis from examples
- Learning efficient logic programs
- Inducing constructor systems from example-terms by detecting syntactical regularities
- Drill and join: a method for exact inductive program synthesis
- Analytical Inductive Functional Programming
- A class of functions synthesized from a finite number of examples and a lisp program scheme
- Automatic insertion of indexing instructions in program synthesis
- Inductive synthesis of term rewriting systems
- scientific article; zbMATH DE number 1396180 (Why is no real title available?)
- From programming-by-example to proving-by-example
- Programming by example and proving by example using higher-order unification
- Program synthesis with best-first bottom-up search
- Partial bounding for recursive function synthesis
- Genetic programming + proof search = automatic improvement
- Synthesis of rewrite programs by higher-order and semantic unification
- Synthetic programming
- Counterexample-guided partial bounding for recursive function synthesis
This page was built for publication: A Methodology for LISP Program Construction from Examples
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4111079)
