The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Program synthesis from polymorphic refinement types
Open accessAbstract
We present a method for synthesizing recursive functions that provably satisfy a given specification in the form of a polymorphic refinement type. We observe that such specifications are particularly suitable for program synthesis for two reasons. First, they offer a unique combination of expressive power and decidability, which enables automatic verification—and hence synthesis—of nontrivial programs. Second, a type-based specification for a program can often be effectively decomposed into independent specifications for its components, causing the synthesizer to consider fewer component combinations and leading to a combinatorial reduction in the size of the search space. At the core of our synthesis procedure is a newalgorithm for refinement type checking, which supports specification decomposition. We have evaluated our prototype implementation on a large set of synthesis problems and found that it exceeds the state of the art in terms of both scalability and usability. The tool was able to synthesize more complex programs than those reported in prior work (several sorting algorithms and operations on balanced search trees), as well as most of the benchmarks tackled by existing synthesizers, often starting from a more concise and intuitive user input.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Self-citation
Research works printed but not linked: 37
- A. Albarghouthi, S. Gulwani, and Z. Kincaid. Recursive program synthesis. In CAV, 2013.
- 10.1145/2837614.2837628 · DOI
- R. Alur, P. ˇ Cerný, and A. Radhakrishna. Synthesis through unification. In CAV, 2015.
- 10.1017/S095679681300018X · DOI · Paper page
- K. Claessen, M. Johansson, D. Rosén, and N. Smallbone. Hipspec: Automating inductive proofs of program properties. In ATx/WInG, 2012.
- 10.1016/0167-6423(95)00021-6 · doi:10.1016/0167-6423(95)00021-6
- 10.1145/351240.351259 · doi:10.1145/351240.351259
- 10.1145/2509136.2509511 · DOI
- 10.1145/964001.964025 · DOI
- 10.1145/2737924.2737977 · DOI · Paper page
- 10.1145/1111037.1111059 · DOI · Paper page
- 10.1145/2837614.2837629 · DOI
- 10.1145/2491956.2462192 · DOI
- 10.1007/978-3-642-45221-5_27 · DOI
- J. P. Inala, X. Qiu, B. Lerner, and A. Solar-Lezama. Type assisted synthesis of recursive transformers on algebraic data types. CoRR, abs/1507.05527, 2015. · arXiv
- 10.1145/1542476.1542510 · DOI
- 10.1145/2509136.2509555 · DOI
- 10.1145/2384616.2384646 · DOI
- 10.1007/s10601-015-9183-0 · doi:10.1007/s10601-015-9183-0
- 10.1145/1065010.1065018 · DOI · Paper page
- 10.5555/2818754.2818829 · doi:10.5555/2818754.2818829
- 10.1016/j.eswa.2011.06.055 · doi:10.1016/j.eswa.2011.06.055
- 10.5555/1813347.1813352 · doi:10.5555/1813347.1813352
- 10.1145/2737924.2738007 · DOI · Paper page
- 10.1145/2254064.2254098 · DOI
- 10.5555/509043 · doi:10.5555/509043
- 10.1145/345099.345100 · DOI · Paper page
- N. Polikarpova, I. Kuraj, and A. Solar-Lezama. Program synthesis from polymorphic refinement types. CoRR, abs/1510.08419, 2016. · arXiv
- 10.1145/1375581.1375602 · doi:10.1145/1375581.1375602
- 10.1145/1542476.1542501 · DOI
- 10.5555/2041552.2041575 · doi:10.5555/2041552.2041575
- 10.1007/978-3-642-37036-6_13 · DOI
- 10.1145/2633357.2633366 · DOI
- 10.1145/2628136.2628161 · DOI
- 10.1145/2784731.2784745 · doi:10.1145/2784731.2784745
- 10.1145/99370.99404 · DOI
- 10.1145/292540.292560 · DOI · Paper page
Cited by
Beyond the Imitation Game: Quantifying and extrapolating the capabilities of language models
Srivastava, A., Rastogi, A., Rao, A., Shoeb, A. A. M., Abid, A., Fisch, A., Brown, A. R., Santoro, A., Gupta, A., Garriga-Alonso, A., et al. (2022) · arXiv · doi:10.48550/arxiv.2206.04615 · Cited by 569
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
Program synthesis using conflict-driven learning
Feng, Y., Martins, R., Bastani, O., & Dillig, I. (2018) · Proceedings of the 39th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/3192366.3192382 · Cited by 111
DreamCoder: bootstrapping inductive program synthesis with wake-sleep library learning
Ellis, K., Wong, C., Nye, M., Sablé-Meyer, M., Morales, L., Hewitt, L., Cary, L., Solar-Lezama, A., & Tenenbaum, J. B. (2021) · Proceedings of the 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation · doi:10.1145/3453483.3454080 · Cited by 103
Self-citationLearning programs by learning from failures
Cropper, A., & Morel, R. (2021) · Machine Learning · doi:10.1007/s10994-020-05934-z · Cited by 86
“Indeed, PL approaches rarely evaluate the ability of their systems to synthesise solutions that generalise, i.e. they do not measure predictive accuracy (Feser et al. 2015; Polikarpova et al. 2016; Albarghouthi et al. 2017; Feng et al. 2018; Raghothaman et al. 2020).”
Background
Metadata
- Authors
- Polikarpova, N., Kuraj, I., & Solar-Lezama, A.
- Venue
- Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation
- Publisher
- ACM
- Published
- 2016-06-02
- Pages
- 522-538
- ISSN
- 1531-7102 (ISSN-L)
- OpenAlex
- W1858945639
- Cited by
- 193
- References
- 1
- FWCI
- 12.34
- Type
- conference paper
- Language
- en
- Open access
- green
- Funders
- Defense Advanced Research Projects Agency (FA8750-14-2-0242)
- National Science Foundation (CCF-1139056)
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: Program synthesis from polymorphic refinement types. https://app.cochat.ai/papers/10.1145/2908080.2908093
- The paper
- Polikarpova, N., Kuraj, I., & Solar-Lezama, A. (2016). Program synthesis from polymorphic refinement types. Proceedings of the 37th ACM SIGPLAN Conference on Programming Language Design and Implementation. https://doi.org/10.1145/2908080.2908093
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.