Inductive synthesis of functional programs: an explanation based generalization approach
From MaRDI portal
Recommendations
Cited in
(19)- Deductive and inductive synthesis of equational programs
- Inductive synthesis of functional programs. Universal planning, folding of finite programs, and schema abstraction by analogical reasoning.
- Ultra-strong machine learning: comprehensibility of programs learned with ILP
- A knowledge-based approach to program synthesis from examples
- Anti-unification for unranked terms and hedges
- A modular order-sorted equational generalization algorithm
- An approach to automatic deductive synthesis of functional 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
- scientific article; zbMATH DE number 408773 (Why is no real title available?)
- scientific article; zbMATH DE number 4124987 (Why is no real title available?)
- scientific article; zbMATH DE number 2090035 (Why is no real title available?)
- scientific article; zbMATH DE number 1396180 (Why is no real title available?)
- Inductive synthesis of recursive logic programs: achievements and prospects
- Neural network-guided synthesis of recursive list functions
- Partial bounding for recursive function synthesis
- Inductive synthesis of structurally recursive functional programs from non-recursive expressions
- Counterexample-guided partial bounding for recursive function synthesis
This page was built for publication: Inductive synthesis of functional programs: an explanation based generalization approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093353)
