New Generation Computing - Selected papers from the international workshop on algorithmic learning theory,1990
Watch what I do: programming by demonstration
Watch what I do: programming by demonstration
Inductive functional programming using incremental program transformation
Artificial Intelligence
A calculational fusion system HYLO
Proceedings of the IFIP TC 2 WG 2.1 international workshop on Algorithmic languages and calculi
Polymorphism and Genetic Programming
EuroGP '01 Proceedings of the 4th European Conference on Genetic Programming
Programming by demonstration: a machine learning approach
Programming by demonstration: a machine learning approach
Generalizing generalized tries
Journal of Functional Programming
Combinators for breadth-first search
Journal of Functional Programming
Interactive Theorem Proving and Program Development
Interactive Theorem Proving and Program Development
Combinatorial sketching for finite programs
Proceedings of the 12th international conference on Architectural support for programming languages and operating systems
Algebras for combinatorial search
Journal of Functional Programming
I/O guided detection of list catamorphisms: towards problem specific use of program templates in IP
Proceedings of the 2010 ACM SIGPLAN workshop on Partial evaluation and program manipulation
Spreadsheet table transformations from examples
Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation
Hi-index | 0.00 |
Inductive functional programming (IFP) is a research field extending from software science to artificial intelligence that deals with functional program synthesis based on generalization from ambiguous specifications, usually given as input-output example pairs. Currently, the approaches to IFP can be categorized into two general groups: the analytical approach that is based on analysis of the input-output example pairs, and the generate-and-test approach that is based on generation and testing of many candidate programs. The analytical approach shows greater promise for application to greater problems because the search space is restricted by the given example set, but it requires much more examples written in orderto yield results that reflect the user's intention, which is bothersome and causes the algorithm to slow down. On the other hand, the generate-and-test approach does not require long description of input-output examples, but does not restrict the search space using the example set. This paper proposes a new approach taking the best of the two, called "analytically-generate-and-test approach", which is based on analytical generation and testing of many program candidates. For generating many candidate programs, the proposed system uses a new variant of I GOR II, the exemplary analytical inductive functional programming algorithm. This new system preserves the efficiency features of analytical approaches, while minimizing the possibility of generating unintended programs even when using fewer input-output examples.