arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2011.08881cs.PLcs.AIcs.LG
收藏

用函数发明和重用学习函数式程序

Learning functional programs with function invention and reuse

University of Oxford(牛津大学)

Andrei Diaconu

摘要:

归纳编程(IP)是一个领域,其主要目标是综合程序,尊重一组例子,给定某种形式的背景知识。本文讨论了IP的一个子领域,归纳函数式编程(IFP)。我们探讨的想法,产生模块化的功能程序,以及如何允许功能重用,目的是减少程序的大小。我们介绍了两种算法,试图解决这个问题,并探讨基于类型的修剪技术的背景下,模块化程序。通过实验这些算法之一的实现,我们表明重用是重要的(如果不是至关重要的)的各种问题和区分两大类的程序,一般会受益于功能重用。

英文摘要:

Inductive programming (IP) is a field whose main goal is synthesising programs that respect a set of examples, given some form of background knowledge. This paper is concerned with a subfield of IP, inductive functional programming (IFP). We explore the idea of generating modular functional programs, and how those allow for function reuse, with the aim to reduce the size of the programs. We introduce two algorithms that attempt to solve the problem and explore type based pruning techniques in the context of modular programs. By experimenting with the implementation of one of those algorithms, we show reuse is important (if not crucial) for a variety of problems and distinguished two broad classes of programs that will generally benefit from function reuse.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑