Recursive Program Synthesis using Paramorphisms

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 recursi...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings of ACM on programming languages Jg. 8; H. PLDI; S. 102 - 125
Hauptverfasser: Hong, Qiantan, Aiken, Alex
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY, USA ACM 20.06.2024
Schlagworte:
Automatic programming
General programming languages
Programming by example
Search-based software engineering
Software and its engineering
Stochastic Synthesis
Recursion Schemes
Examples
Program Synthesis
ISSN:2475-1421, 2475-1421
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
ISSN:2475-1421
2475-1421
DOI:10.1145/3656381