Inductive programming

Inductive programming (IP) is a special area of automatic programming, covering research from artificial intelligence and programming, which… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1993-2017
024619932017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2015
2015
Inductive programming can liberate users from performing tedious and repetitive tasks. 
  • figure 2
  • figure 1
  • figure 3
  • figure 4
  • table 1
Is this relevant?
2013
2013
Inductive programming has focussed on problems where data are not necessarily big, but representation and patterns may be deep… (More)
Is this relevant?
Review
2009
Review
2009
Inductive programming—the use of inductive reasoning methods for programming, algorithm design, and software development—is a… (More)
  • figure 1
Is this relevant?
2009
2009
Inductive programming systems characteristically exhibit an exponential explosion in search time as one increases the size of the… (More)
  • table 1
  • table 2
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2008
2008
Analytical inductive programming and evolutionary inductive programming are two opposing strategies for learning recursive… (More)
  • figure 1
  • table 1
Is this relevant?
2008
2008
In this paper we present a comparison of several inductive programming (IP) systems. IP addresses the problem of learning… (More)
  • figure 1
  • table 1
  • table 2
  • table 3
Is this relevant?
2008
2008
The research field of inductive programming is concerned with the design of algorithms for learning computer programs with… (More)
Is this relevant?
2001
2001
We developed an efficient, analytical approach for learning recursive functional programs from examples. Igor2 is a realization… (More)
Is this relevant?
1997
1997
started a formal science to guide software production. The underlying framework of this science has always been based on… (More)
  • figure 2
  • table 1
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1993
1993
let ((p; y) :: t) = reverse s 0 in (p; y) = (n 0 ; n 0) ^ 8(p 0 ; y 0) 2 t: p 0 < n 0 ^ y 0 6 = n 0 Given the precondition O(n… (More)
  • figure 6
  • figure 4
  • figure 3
  • figure 1
Is this relevant?