Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
Power of Brute-Force Search in Strongly-Typed Inductive Functional Programming Automation
复制标题
强类型归纳函数编程自动化中强力搜索的威力
DOI：
10.1007/978-3-540-28633-2_10
复制
发表时间：
2004
期刊：
影响因子：
--
通讯作者：
Susumu Katayama
中科院分区：
文献类型：
--
作者：
Susumu Katayama
介绍了将暴力搜索应用于函数式编程自动化的成功案例，并与传统的遗传编程方法进行了比较。根据类型和应满足的属性信息，该算法能够使用预先配置的一组功能组件（或库）自动找到最短的Haskell程序，并且无需在每次请求新的功能程序时都设计库。
根据所提出的实验，即使我们始终使用为通用设计的库，也可以在几秒钟内找到由多个功能应用程序组成的程序。此外，所提出的算法可以有效地告知与给定类型一致的给定大小的可能函数的数量，因此可以通过提供基线性能信息来成为评估遗传编程等其他方法的工具。
A successful case of applying brute-force search to functional programming automation is presented and compared with a conventional genetic programming method. From the information of the type and the property that should be satisfied, this algorithm is able to find automatically the shortest Haskell program using the set of function components (or library) configured beforehand, and there is no need to design the library every time one requests a new functional program.
According to the presented experiments, programs consisted of several function applications can be found within some seconds even if we always use the library designed for general use. In addition, the proposed algorithm can efficiently tell the number of possible functions of given size that are consistent with the given type, and thus can be a tool to evaluate other methods like genetic programming by providing the information of the baseline performance.