Work

Recursive Program Synthesis using Paramorphisms

Year: 2024

Type: article

Abstract: We show that synthesizing recursive functional programs using a class of primitive recursive combinators is both simpler and solves more benchmarks from the literature than previously proposed approaches. Our method synthesizes paramorphisms, a class of programs that includes the most common recursive programming patterns on algebraic data types. The crux of our approach is to split the synthesis problem into two parts: a multi-hole template that fixes the recursive structure, and a search for non-recursive program fragments to fill the template holes.

Source: Proceedings of the ACM on Programming Languages

DOI: 10.1145/3656381

Authors: Qiantan Hong, Alex Aiken

Institution: Stanford University

Language: English

Topic: Logic, programming, and type systems

Subfield: Software

Field: Computer Science

Domain: Physical Sciences

Open Access status: diamond

OpenAlex ID: W4399850818

FWCI: 4.407

Cites: 55

Cited by: 13

Related to: 10