利用参数化多态通过遗传编程求解新颖程序合成问题
Solving Novel Program Synthesis Problems with Genetic Programming using Parametric Polymorphism
AI总结:
本文通过实验探索 CBGP 对泛型数据类型、高阶函数和多态签名的支持,证明其能求解其他 GP 系统无法表示的新颖程序合成问题。
摘要:
面向通用程序合成的当代遗传编程(GP)系统主要关注进化能够操作来自一组标准原始数据类型和简单索引数据结构的值的程序。相比之下,人类程序员不会将自己局限于一小组有限的数据类型,而是使用多态来表达无限数量的类型,包括嵌套数据结构、乘积类型和泛型函数。Code-building Genetic Programming(CBGP,代码构建遗传编程)是最近提出的一种方法,它使用基于栈的编译和形式化类型系统,从线性基因组编译类型安全的程序。尽管先前关于 CBGP 的工作已经初步展示了进化程序内部的多态性,但我们通过进化使用键值映射、元组和集合等泛型数据类型,以及高阶函数和具有多态类型签名的函数的程序,对这些能力进行了更深入的探索。在我们的实验中,CBGP 能够求解具有所有这些特性的问题,而据我们所知,其他每个 GP 系统都存在限制,使其甚至无法考虑具有这些特性的问题。这一展示朝着使 GP 的表达能力与现实世界编程完全对齐迈出了重要一步。
英文摘要:
Contemporary genetic programming (GP) systems for general program synthesis have been primarily concerned with evolving programs that can manipulate values from a standard set of primitive data types and simple indexed data structures. In contrast, human programmers do not limit themselves to a small finite set of data types and use polymorphism to express an unbounded number of types including nested data structures, product types, and generic functions. Code-building Genetic Programming (CBGP) is a recently introduced method that compiles type-safe programs from linear genomes using stack-based compilation and a formal type system. Although prior work with CBGP has shown initial demonstrations of polymorphism inside evolved programs, we have provided a deeper exploration of these capabilities through the evolution of programs which make use of generic data types such as key-value maps, tuples, and sets, as well as higher order functions and functions with polymorphic type signatures. In our experiments, CBGP is able to solve problems with all of these properties, where every other GP system that we know of has restrictions that make it unable to even consider problems with these properties. This demonstration provides a significant step towards fully aligning the expressiveness of GP to real world programming.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。