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.

中文翻译：

---

通过功能发明和重用学习功能程序

归纳编程 (IP) 是一个领域，其主要目标是在给定某种形式的背景知识的情况下合成尊重一组示例的程序。本文涉及 IP 的一个子领域，即归纳函数式编程 (IFP)。我们探索了生成模块化功能程序的想法，以及这些程序如何允许功能重用，目的是减少程序的大小。我们介绍了两种试图解决问题的算法，并在模块化程序的上下文中探索基于类型的修剪技术。通过试验这些算法之一的实现，我们表明重用对于各种问题很重要（如果不是关键的话），并区分了两大类通常会从函数重用中受益的程序。