Synthesizing data structure transformations from input-output examples
The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Abstract
We present a method for example-guided synthesis of functional programs over recursive data structures. Given a set of input-output examples, our method synthesizes a program in a functional language with higher-order combinators like map and fold. The synthesized program is guaranteed to be the simplest program in the language to fit the examples. Our approach combines three technical ideas: inductive generalization, deduction, and enumerative search. First, we generalize the input-output examples into hypotheses about the structure of the target program. For each hypothesis, we use deduction to infer new input/output examples for the missing subexpressions. This leads to a new subproblem where the goal is to synthesize expressions within each hypothesis. Since not every hypothesis can be realized into a program that fits the examples, we use a combination of best-first enumeration and deduction to search for a hypothesis that meets our needs. We have implemented our method in a tool called λ2, and we evaluate this tool on a large set of synthesis problems involving lists, trees, and nested data structures. The experiments demonstrate the scalability and broad scope of λ2. A highlight is the synthesis of a program believed to be the world's earliest functional pearl.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Alur, R., Bodik, R., Juniwal, G., Martin, M. M. K., Raghothaman, M., Seshia, S. A., Singh, R., Solar-Lezama, A., Torlak, E., & Udupa, A. (2013) · 2013 Formal Methods in Computer-Aided Design · doi:10.1109/fmcad.2013.6679385 · Cited by 656
Research works printed but not linked: 31
- 10.5555/2958031.2958069 · doi:10.5555/2958031.2958069
- 10.1016/B978-0-08-011356-2.50006-9 · doi:10.1016/b978-0-08-011356-2.50006-9
- 10.1145/2535838.2535860 · DOI
- 10.1007/978-3-642-02658-4_14 · DOI · Paper page
- 10.1145/2535838.2535859 · DOI
- 10.1145/1291151.1291161 · doi:10.1145/1291151.1291161
- 10.1007/978-3-319-08867-9_32 · DOI
- 10.1007/978-3-319-08867-9_5 · DOI · Paper page
- 10.5555/1998496.1998498 · doi:10.5555/1998496.1998498
- 10.1145/1926385.1926423 · DOI · Paper page
- 10.1145/2491956.2462192 · DOI · Paper page
- 10.1145/1993498.1993536 · DOI
- 10.1007/978-3-540-89197-0_21 · DOI
- E. Kitzelmann . Inductive programming : A survey of program synthesis techniques. In Approaches and Applications of Inductive Programming , Third International Workshop , pages 50– 73 , 2009 . E. Kitzelmann. Inductive programming: A survey of program synthesis techniques. In Approaches and Applications of Inductive Programming, Third International Workshop, pages 50–73, 2009.
- 10.1007/978-3-642-00515-2_7 · DOI
- 10.1007/s13218-010-0071-x · DOI
- 10.5555/1248547.1248562 · doi:10.5555/1248547.1248562
- 10.1145/1806596.1806632 · DOI
- N. Lavrac and S. Dzeroski . Inductive logic programming . In WLP , pages 146– 160 . Springer, 1994. N. Lavrac and S. Dzeroski. Inductive logic programming. In WLP, pages 146–160. Springer, 1994.
- 10.1145/2594291.2594333 · DOI · Paper page
- H. Lieberman . Your wish is my command: Programming by example . Morgan Kaufmann , 2001 . H. Lieberman. Your wish is my command: Programming by example. Morgan Kaufmann, 2001.
- 10.1145/1065010.1065018 · DOI · Paper page
- A. Menon , O. Tamuz , S. Gulwani , B. Lampson , and A. Kalai . A machine learning framework for programming by example . In ICML , pages 187– 195 , 2013 . A. Menon, O. Tamuz, S. Gulwani, B. Lampson, and A. Kalai. A machine learning framework for programming by example. In ICML, pages 187–195, 2013.
- 10.1016/0004-3702(94)00042-Y · DOI
- 10.1145/2254064.2254098 · DOI
- 10.1145/2594291.2594297 · DOI · Paper page
- 10.1007/978-3-642-37036-6_31 · DOI
- 10.1007/978-3-642-31424-7_44 · DOI
- 10.1145/1168857.1168907 · DOI · Paper page
- 10.1007/s10009-012-0223-4 · DOI
- 10.1007/s10009-012-0232-3 · DOI
Cited by
Vaithilingam, P., Zhang, T., & Glassman, E. L. (2022) · CHI Conference on Human Factors in Computing Systems Extended Abstracts · doi:10.1145/3491101.3519665 · Cited by 660
SQLizer: query synthesis from natural language
Yaghmazadeh, N., Wang, Y., Dillig, I., & Dillig, T. (2017) · Proceedings of the ACM on Programming Languages · doi:10.1145/3133887 · Cited by 279
Self-citationIn-IDE Code Generation from Natural Language: Promise and Challenges
Xu, F. F., Vasilescu, B., & Neubig, G. (2022) · ACM Transactions on Software Engineering and Methodology · doi:10.1145/3487569 · Cited by 154
Learning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86
Inductive Logic Programming At 30: A New Introduction
Cropper, A., & Dumančić, S. (2022) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1.13507 · Cited by 83
Metadata
- Authors
- Feser, J. K., Chaudhuri, S., & Dillig, I.
- Venue
- ACM SIGPLAN Notices
- Published
- 2015-06-03
- Volume
- 50
- Issue
- 6
- Pages
- 229-239
- ISSN
- 0362-1340 (ISSN-L)
- 1558-1160
- OpenAlex
- W4253977062
- Cited by
- 80
- References
- 1
- FWCI
- 2.50
- Type
- journal article
- Language
- en
- Open access
- closed
- Funders
- National Science Foundation (1162076)
- Defense Advanced Research Projects Agency (FA8750-14-2-0270)
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Synthesizing data structure transformations from input-output examples. https://app.cochat.ai/papers/10.1145/2813885.2737977
- The paper
- Feser, J. K., Chaudhuri, S., & Dillig, I. (2015). Synthesizing data structure transformations from input-output examples. ACM SIGPLAN Notices. https://doi.org/10.1145/2813885.2737977
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.