{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/program-synthesis/papers/2","list_of":"/task/program-synthesis","task":"Program Synthesis","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"repositories listed in the archive (most first), then date (newest first), then slug","page":2,"pages_in_order":5,"rows_per_page":100,"rows":[101,200],"of":423,"counts":{"archive_papers_tagged":423,"with_a_code_link":179,"where_syntology_ran_a_sample":69,"not_listed_spam_title":0,"listed":423,"listed_where_code_ran":69,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":52,"every_run_a_failure_of_syntologys_instrument":17,"listed_with_a_run_with_no_instrument_failure":52,"listed_every_run_a_failure_of_syntologys_instrument":17,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/program-synthesis","prev":"/task/program-synthesis","next":"/task/program-synthesis/papers/3","papers":[{"url":"/paper/graphs-constraints-and-search-for-the","slug":"graphs-constraints-and-search-for-the","title":"Graphs, Constraints, and Search for the Abstraction and Reasoning Corpus","date":"2022-10-18","arxiv_id":"2210.09880","repositories_listed":1,"syntology":null},{"url":"/paper/data-types-as-a-more-ergonomic-frontend-for","slug":"data-types-as-a-more-ergonomic-frontend-for","title":"Data types as a more ergonomic frontend for Grammar-Guided Genetic Programming","date":"2022-10-10","arxiv_id":"2210.04826","repositories_listed":1,"syntology":null},{"url":"/paper/relational-program-synthesis-with-numerical","slug":"relational-program-synthesis-with-numerical","title":"Relational program synthesis with numerical reasoning","date":"2022-10-03","arxiv_id":"2210.00764","repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-driven-program-synthesis-via","slug":"knowledge-driven-program-synthesis-via","title":"Knowledge-Driven Program Synthesis via Adaptive Replacement Mutation and Auto-constructed Subprogram Archives","date":"2022-09-08","arxiv_id":"2209.03736","repositories_listed":1,"syntology":null},{"url":"/paper/pangu-coder-program-synthesis-with-function","slug":"pangu-coder-program-synthesis-with-function","title":"PanGu-Coder: Program Synthesis with Function-Level Language Modeling","date":"2022-07-22","arxiv_id":"2207.11280","repositories_listed":1,"syntology":null},{"url":"/paper/github-copilot-ai-pair-programmer-asset-or","slug":"github-copilot-ai-pair-programmer-asset-or","title":"GitHub Copilot AI pair programmer: Asset or Liability?","date":"2022-06-30","arxiv_id":"2206.15331","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/github-copilot-ai-pair-programmer-asset-or#ran","syntology_url":"https://syntology.ai/paper/2206.15331","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2206.15331"}},"official":{"repos":["copilot-eval-replication-package/copilotevaluation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-programs-by-combining-programs","slug":"learning-programs-by-combining-programs","title":"Learning logic programs by combining programs","date":"2022-06-01","arxiv_id":"2206.01614","repositories_listed":1,"syntology":null},{"url":"/paper/the-environmental-discontinuity-hypothesis","slug":"the-environmental-discontinuity-hypothesis","title":"The Environmental Discontinuity Hypothesis for Down-Sampled Lexicase Selection","date":"2022-05-31","arxiv_id":"2205.15931","repositories_listed":1,"syntology":null},{"url":"/paper/learning-from-self-sampled-correct-and","slug":"learning-from-self-sampled-correct-and","title":"Learning Math Reasoning from Self-Sampled Correct and Partially-Correct Solutions","date":"2022-05-28","arxiv_id":"2205.14318","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learning-from-self-sampled-correct-and#ran","syntology_url":"https://syntology.ai/paper/2205.14318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2205.14318"}},"official":{"repos":["microsoft/tracecodegen"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/transformer-based-program-synthesis-for-low","slug":"transformer-based-program-synthesis-for-low","title":"Transformer-based Program Synthesis for Low-Data Environments","date":"2022-05-18","arxiv_id":"2205.09246","repositories_listed":1,"syntology":null},{"url":"/paper/from-solution-synthesis-to-student-attempt","slug":"from-solution-synthesis-to-student-attempt","title":"From {Solution Synthesis} to {Student Attempt Synthesis} for Block-Based Visual Programming Tasks","date":"2022-05-03","arxiv_id":"2205.01265","repositories_listed":1,"syntology":null},{"url":"/paper/what-if-generating-code-to-answer-simulation","slug":"what-if-generating-code-to-answer-simulation","title":"What If: Generating Code to Answer Simulation Questions","date":"2022-04-16","arxiv_id":"2204.07835","repositories_listed":1,"syntology":null},{"url":"/paper/crossbeam-learning-to-search-in-bottom-up-1","slug":"crossbeam-learning-to-search-in-bottom-up-1","title":"CrossBeam: Learning to Search in Bottom-Up Program Synthesis","date":"2022-03-20","arxiv_id":"2203.10452","repositories_listed":1,"syntology":{"n":6,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/crossbeam-learning-to-search-in-bottom-up-1#ran","syntology_url":"https://syntology.ai/paper/2203.10452","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.10452"}},"official":{"repos":["google-research/crossbeam"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/less-is-more-summary-of-long-instructions-is","slug":"less-is-more-summary-of-long-instructions-is","title":"Less is More: Summary of Long Instructions is Better for Program Synthesis","date":"2022-03-16","arxiv_id":"2203.08597","repositories_listed":1,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/less-is-more-summary-of-long-instructions-is#ran","syntology_url":"https://syntology.ai/paper/2203.08597","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2203.08597"}},"official":{"repos":["kurbster/prompt-summarization"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/open-ended-knowledge-tracing","slug":"open-ended-knowledge-tracing","title":"GPT-based Open-Ended Knowledge Tracing","date":"2022-02-21","arxiv_id":"2203.03716","repositories_listed":1,"syntology":null},{"url":"/paper/learning-logic-programs-by-discovering-where","slug":"learning-logic-programs-by-discovering-where","title":"Learning logic programs by discovering where not to search","date":"2022-02-20","arxiv_id":"2202.09806","repositories_listed":1,"syntology":null},{"url":"/paper/explanatory-learning-beyond-empiricism-in-1","slug":"explanatory-learning-beyond-empiricism-in-1","title":"Explanatory Learning: Beyond Empiricism in Neural Networks","date":"2022-01-25","arxiv_id":"2201.10222","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-explainable-counterfactual","slug":"synthesizing-explainable-counterfactual","title":"Synthesizing explainable counterfactual policies for algorithmic recourse with program synthesis","date":"2022-01-18","arxiv_id":"2201.07135","repositories_listed":1,"syntology":null},{"url":"/paper/from-examples-to-rules-neural-guided-rule","slug":"from-examples-to-rules-neural-guided-rule","title":"From Examples to Rules: Neural Guided Rule Synthesis for Information Extraction","date":"2022-01-16","arxiv_id":"2202.00475","repositories_listed":1,"syntology":null},{"url":"/paper/a-neural-network-solves-and-generates","slug":"a-neural-network-solves-and-generates","title":"A Neural Network Solves, Explains, and Generates University Math Problems by Program Synthesis and Few-Shot Learning at Human Level","date":"2021-12-31","arxiv_id":"2112.15594","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-neural-network-solves-and-generates#ran","syntology_url":"https://syntology.ai/paper/2112.15594","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.15594"}},"official":{"repos":["idrori/mathq"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-synthesis-of-diverse-weak","slug":"automatic-synthesis-of-diverse-weak","title":"Automatic Synthesis of Diverse Weak Supervision Sources for Behavior Analysis","date":"2021-11-30","arxiv_id":"2111.15186","repositories_listed":1,"syntology":null},{"url":"/paper/explainable-natural-language-to-bash","slug":"explainable-natural-language-to-bash","title":"Explainable Natural Language to Bash Translation using Abstract Syntax Tree","date":"2021-11-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/scaling-neural-program-synthesis-with","slug":"scaling-neural-program-synthesis-with","title":"Scaling Neural Program Synthesis with Distribution-based Search","date":"2021-10-24","arxiv_id":"2110.12485","repositories_listed":1,"syntology":null},{"url":"/paper/learning-logic-programs-through-divide","slug":"learning-logic-programs-through-divide","title":"Learning logic programs through divide, constrain, and conquer","date":"2021-09-16","arxiv_id":"2109.07818","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-synthesize-programs-as","slug":"learning-to-synthesize-programs-as","title":"Learning to Synthesize Programs as Interpretable and Generalizable Policies","date":"2021-08-31","arxiv_id":"2108.13643","repositories_listed":1,"syntology":{"n":20,"n_ran":15,"n_constructed":6,"n_ran_checked":8,"n_instrument":7,"n_unverified":5,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":0,"phrase":"15 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 7 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/learning-to-synthesize-programs-as#ran","syntology_url":"https://syntology.ai/paper/2108.13643","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.13643"}},"official":null}},{"url":"/paper/autoencoders-as-tools-for-program-synthesis","slug":"autoencoders-as-tools-for-program-synthesis","title":"Autoencoders as Tools for Program Synthesis","date":"2021-08-16","arxiv_id":"2108.07129","repositories_listed":1,"syntology":null},{"url":"/paper/program-synthesis-with-large-language-models","slug":"program-synthesis-with-large-language-models","title":"Program Synthesis with Large Language Models","date":"2021-08-16","arxiv_id":"2108.07732","repositories_listed":1,"syntology":null},{"url":"/paper/signalgp-lite-event-driven-genetic","slug":"signalgp-lite-event-driven-genetic","title":"SignalGP-Lite: Event Driven Genetic Programming Library for Large-Scale Artificial Life Applications","date":"2021-08-01","arxiv_id":"2108.00382","repositories_listed":1,"syntology":null},{"url":"/paper/mwp-bert-a-strong-baseline-for-math-word","slug":"mwp-bert-a-strong-baseline-for-math-word","title":"MWP-BERT: Numeracy-Augmented Pre-training for Math Word Problem Solving","date":"2021-07-28","arxiv_id":"2107.13435","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mwp-bert-a-strong-baseline-for-math-word#ran","syntology_url":"https://syntology.ai/paper/2107.13435","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13435"}},"official":{"repos":["lzhenwen/mwp-bert"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/unsupervised-learning-of-neurosymbolic","slug":"unsupervised-learning-of-neurosymbolic","title":"Unsupervised Learning of Neurosymbolic Encoders","date":"2021-07-28","arxiv_id":"2107.13132","repositories_listed":1,"syntology":null},{"url":"/paper/a-reinforcement-learning-environment-for-2","slug":"a-reinforcement-learning-environment-for-2","title":"A Reinforcement Learning Environment for Mathematical Reasoning via Program Synthesis","date":"2021-07-15","arxiv_id":"2107.07373","repositories_listed":1,"syntology":null},{"url":"/paper/latent-execution-for-neural-program-synthesis","slug":"latent-execution-for-neural-program-synthesis","title":"Latent Execution for Neural Program Synthesis","date":"2021-06-29","arxiv_id":"2107.00101","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/latent-execution-for-neural-program-synthesis#ran","syntology_url":"https://syntology.ai/paper/2107.00101","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00101"}},"official":{"repos":["jungyhuk/latent-execution"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/spreadsheetcoder-formula-prediction-from-semi-1","slug":"spreadsheetcoder-formula-prediction-from-semi-1","title":"SpreadsheetCoder: Formula Prediction from Semi-structured Context","date":"2021-06-26","arxiv_id":"2106.15339","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-combine-per-example-solutions-for","slug":"learning-to-combine-per-example-solutions-for","title":"Learning to Combine Per-Example Solutions for Neural Program Synthesis","date":"2021-06-14","arxiv_id":"2106.07175","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-combine-per-example-solutions-for#ran","syntology_url":"https://syntology.ai/paper/2106.07175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07175"}},"official":{"repos":["shrivastavadisha/N-PEPS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/sample-efficient-linguistic-generalizations","slug":"sample-efficient-linguistic-generalizations","title":"Sample-efficient Linguistic Generalizations through Program Synthesis: Experiments with Phonology Problems","date":"2021-06-11","arxiv_id":"2106.06566","repositories_listed":1,"syntology":null},{"url":"/paper/program-synthesis-as-dependency-quantified","slug":"program-synthesis-as-dependency-quantified","title":"Program Synthesis as Dependency Quantified Formula Modulo Theory","date":"2021-05-19","arxiv_id":"2105.09221","repositories_listed":1,"syntology":null},{"url":"/paper/codetrans-towards-cracking-the-language-of","slug":"codetrans-towards-cracking-the-language-of","title":"CodeTrans: Towards Cracking the Language of Silicon's Code Through Self-Supervised Deep Learning and High Performance Computing","date":"2021-04-06","arxiv_id":"2104.02443","repositories_listed":1,"syntology":null},{"url":"/paper/toward-neural-network-guided-program","slug":"toward-neural-network-guided-program","title":"Toward Neural-Network-Guided Program Synthesis and Verification","date":"2021-03-17","arxiv_id":"2103.09414","repositories_listed":1,"syntology":null},{"url":"/paper/program-synthesis-guided-reinforcement","slug":"program-synthesis-guided-reinforcement","title":"Program Synthesis Guided Reinforcement Learning for Partially Observed Environments","date":"2021-02-22","arxiv_id":"2102.11137","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/program-synthesis-guided-reinforcement#ran","syntology_url":"https://syntology.ai/paper/2102.11137","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11137"}},"official":{"repos":["yycdavid/program-synthesis-guided-rl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/bf-a-language-for-general-purpose-neural","slug":"bf-a-language-for-general-purpose-neural","title":"BF++: a language for general-purpose program synthesis","date":"2021-01-23","arxiv_id":"2101.09571","repositories_listed":1,"syntology":null},{"url":"/paper/analysis-of-evolutionary-program-synthesis","slug":"analysis-of-evolutionary-program-synthesis","title":"Analysis of Evolutionary Program Synthesis for Card Games","date":"2021-01-08","arxiv_id":"2101.03172","repositories_listed":1,"syntology":null},{"url":"/paper/tag-based-genetic-regulation-for-genetic","slug":"tag-based-genetic-regulation-for-genetic","title":"Tag-based regulation of modules in genetic programming improves context-dependent problem solving","date":"2020-12-16","arxiv_id":"2012.09229","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-execute-programs-with-instruction","slug":"learning-to-execute-programs-with-instruction","title":"Learning to Execute Programs with Instruction Pointer Attention Graph Neural Networks","date":"2020-10-23","arxiv_id":"2010.12621","repositories_listed":1,"syntology":null},{"url":"/paper/fusion-360-gallery-a-dataset-and-environment-1","slug":"fusion-360-gallery-a-dataset-and-environment-1","title":"Fusion 360 Gallery: A Dataset and Environment for Programmatic CAD Construction from Human Design Sequences","date":"2020-10-05","arxiv_id":"2010.02392","repositories_listed":1,"syntology":null},{"url":"/paper/squares-a-sql-synthesizer-using-query-reverse","slug":"squares-a-sql-synthesizer-using-query-reverse","title":"SQUARES: A SQL Synthesizer Using Query Reverse Engineering","date":"2020-08-31","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/robot-action-selection-learning-via-layered","slug":"robot-action-selection-learning-via-layered","title":"Robot Action Selection Learning via Layered Dimension Informed Program Synthesis","date":"2020-08-10","arxiv_id":"2008.04133","repositories_listed":1,"syntology":null},{"url":"/paper/code-building-genetic-programming","slug":"code-building-genetic-programming","title":"Code Building Genetic Programming","date":"2020-08-09","arxiv_id":"2008.03649","repositories_listed":1,"syntology":null},{"url":"/paper/sketchgraphs-a-large-scale-dataset-for","slug":"sketchgraphs-a-large-scale-dataset-for","title":"SketchGraphs: A Large-Scale Dataset for Modeling Relational Geometry in Computer-Aided Design","date":"2020-07-16","arxiv_id":"2007.08506","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":7,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/sketchgraphs-a-large-scale-dataset-for#ran","syntology_url":"https://syntology.ai/paper/2007.08506","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08506"}},"official":{"repos":["PrincetonLIPS/SketchGraphs"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/synthesize-execute-and-debug-learning-to","slug":"synthesize-execute-and-debug-learning-to","title":"Synthesize, Execute and Debug: Learning to Repair for Neural Program Synthesis","date":"2020-07-16","arxiv_id":"2007.08095","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":16,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":16,"n_pointer_only":0,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 0 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/synthesize-execute-and-debug-learning-to#ran","syntology_url":"https://syntology.ai/paper/2007.08095","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.08095"}},"official":null}},{"url":"/paper/plans-robust-program-learning-from-neurally","slug":"plans-robust-program-learning-from-neurally","title":"PLANS: Robust Program Learning from Neurally Inferred Specifications","date":"2020-06-05","arxiv_id":"2006.03312","repositories_listed":1,"syntology":null},{"url":"/paper/guiding-program-synthesis-by-learning-to","slug":"guiding-program-synthesis-by-learning-to","title":"Guiding Program Synthesis by Learning to Generate Examples","date":"2020-05-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/knowledge-refactoring-for-program-induction","slug":"knowledge-refactoring-for-program-induction","title":"Knowledge Refactoring for Inductive Program Synthesis","date":"2020-04-21","arxiv_id":"2004.09931","repositories_listed":1,"syntology":null},{"url":"/paper/learning-compositional-rules-via-neural","slug":"learning-compositional-rules-via-neural","title":"Learning Compositional Rules via Neural Program Synthesis","date":"2020-03-12","arxiv_id":"2003.05562","repositories_listed":1,"syntology":{"n":5,"n_ran":4,"n_constructed":1,"n_ran_checked":1,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-compositional-rules-via-neural#ran","syntology_url":"https://syntology.ai/paper/2003.05562","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.05562"}},"official":{"repos":["mtensor/rulesynthesis"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/incremental-sampling-without-replacement-for","slug":"incremental-sampling-without-replacement-for","title":"Incremental Sampling Without Replacement for Sequence Models","date":"2020-02-21","arxiv_id":"2002.09067","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/incremental-sampling-without-replacement-for#ran","syntology_url":"https://syntology.ai/paper/2002.09067","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09067"}},"official":{"repos":["google-research/unique-randomizer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-sequence-to-sequence-learning","slug":"evaluating-sequence-to-sequence-learning","title":"Evaluating Sequence-to-Sequence Learning Models for If-Then Program Synthesis","date":"2020-02-10","arxiv_id":"2002.03485","repositories_listed":1,"syntology":null},{"url":"/paper/comparison-of-syntactic-and-semantic","slug":"comparison-of-syntactic-and-semantic","title":"Comparison of Syntactic and Semantic Representations of Programs in Neural Embeddings","date":"2020-01-24","arxiv_id":"2001.09201","repositories_listed":1,"syntology":null},{"url":"/paper/generating-programmatic-referring-expressions","slug":"generating-programmatic-referring-expressions","title":"Generating Programmatic Referring Expressions via Program Synthesis","date":"2020-01-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/adaptive-correlated-monte-carlo-for-1","slug":"adaptive-correlated-monte-carlo-for-1","title":"Adaptive Correlated Monte Carlo for Contextual Categorical Sequence Generation","date":"2019-12-31","arxiv_id":"1912.13151","repositories_listed":1,"syntology":null},{"url":"/paper/novel-positional-encodings-to-enable-tree","slug":"novel-positional-encodings-to-enable-tree","title":"Novel positional encodings to enable tree-based transformers","date":"2019-12-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/deepsynth-program-synthesis-for-automatic","slug":"deepsynth-program-synthesis-for-automatic","title":"DeepSynth: Automata Synthesis for Automatic Task Segmentation in Deep Reinforcement Learning","date":"2019-11-22","arxiv_id":"1911.10244","repositories_listed":1,"syntology":null},{"url":"/paper/program-synthesis-performance-constrained-by","slug":"program-synthesis-performance-constrained-by","title":"Program synthesis performance constrained by non-linear spatial relations in Synthetic Visual Reasoning Test","date":"2019-11-18","arxiv_id":"1911.07721","repositories_listed":1,"syntology":null},{"url":"/paper/making-sense-of-sensory-input","slug":"making-sense-of-sensory-input","title":"Making sense of sensory input","date":"2019-10-05","arxiv_id":"1910.02227","repositories_listed":1,"syntology":null},{"url":"/paper/synthesizing-action-sequences-for-modifying","slug":"synthesizing-action-sequences-for-modifying","title":"Synthesizing Action Sequences for Modifying Model Decisions","date":"2019-09-30","arxiv_id":"1910.00057","repositories_listed":1,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/synthesizing-action-sequences-for-modifying#ran","syntology_url":"https://syntology.ai/paper/1910.00057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00057"}},"official":null}},{"url":"/paper/program-synthesis-and-semantic-parsing-with","slug":"program-synthesis-and-semantic-parsing-with","title":"Program Synthesis and Semantic Parsing with Learned Code Idioms","date":"2019-06-26","arxiv_id":"1906.10816","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/program-synthesis-and-semantic-parsing-with#ran","syntology_url":"https://syntology.ai/paper/1906.10816","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.10816"}},"official":{"repos":["rshin/seq2struct"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spoc-search-based-pseudocode-to-code","slug":"spoc-search-based-pseudocode-to-code","title":"SPoC: Search-based Pseudocode to Code","date":"2019-06-12","arxiv_id":"1906.04908","repositories_listed":1,"syntology":null},{"url":"/paper/why-did-you-do-that-explaining-black-box","slug":"why-did-you-do-that-explaining-black-box","title":"\"Why did you do that?\": Explaining black box models with Inductive Synthesis","date":"2019-04-17","arxiv_id":"1904.09273","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-infer-program-sketches","slug":"learning-to-infer-program-sketches","title":"Learning to Infer Program Sketches","date":"2019-02-17","arxiv_id":"1902.06349","repositories_listed":1,"syntology":null},{"url":"/paper/stepping-stones-to-inductive-synthesis-of-low","slug":"stepping-stones-to-inductive-synthesis-of-low","title":"Stepping Stones to Inductive Synthesis of Low-Level Looping Programs","date":"2018-11-26","arxiv_id":"1811.10665","repositories_listed":1,"syntology":null},{"url":"/paper/automatic-program-synthesis-of-long-programs","slug":"automatic-program-synthesis-of-long-programs","title":"Automatic Program Synthesis of Long Programs with a Learned Garbage Collector","date":"2018-09-12","arxiv_id":"1809.04682","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/automatic-program-synthesis-of-long-programs#ran","syntology_url":"https://syntology.ai/paper/1809.04682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1809.04682"}},"official":{"repos":["amitz25/PCCoder"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-guided-constraint-logic-programming","slug":"neural-guided-constraint-logic-programming","title":"Neural Guided Constraint Logic Programming for Program Synthesis","date":"2018-09-08","arxiv_id":"1809.02840","repositories_listed":1,"syntology":null},{"url":"/paper/naps-natural-program-synthesis-dataset","slug":"naps-natural-program-synthesis-dataset","title":"NAPS: Natural Program Synthesis Dataset","date":"2018-07-06","arxiv_id":"1807.03168","repositories_listed":1,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/naps-natural-program-synthesis-dataset#ran","syntology_url":"https://syntology.ai/paper/1807.03168","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03168"}},"official":null}},{"url":"/paper/neural-program-synthesis-from-diverse","slug":"neural-program-synthesis-from-diverse","title":"Neural Program Synthesis from Diverse Demonstration Videos","date":"2018-07-01","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/recent-advances-in-neural-program-synthesis","slug":"recent-advances-in-neural-program-synthesis","title":"Recent Advances in Neural Program Synthesis","date":"2018-02-07","arxiv_id":"1802.02353","repositories_listed":1,"syntology":null},{"url":"/paper/dynamic-neural-program-embedding-for-program","slug":"dynamic-neural-program-embedding-for-program","title":"Dynamic Neural Program Embedding for Program Repair","date":"2017-11-20","arxiv_id":"1711.07163","repositories_listed":1,"syntology":null},{"url":"/paper/selecting-representative-examples-for-program","slug":"selecting-representative-examples-for-program","title":"Selecting Representative Examples for Program Synthesis","date":"2017-11-09","arxiv_id":"1711.03243","repositories_listed":1,"syntology":null},{"url":"/paper/a-probabilistic-and-multi-objective-analysis","slug":"a-probabilistic-and-multi-objective-analysis","title":"A probabilistic and multi-objective analysis of lexicase selection and epsilon-lexicase selection","date":"2017-09-15","arxiv_id":"1709.05394","repositories_listed":1,"syntology":null},{"url":"/paper/learning-to-infer-graphics-programs-from-hand","slug":"learning-to-infer-graphics-programs-from-hand","title":"Learning to Infer Graphics Programs from Hand-Drawn Images","date":"2017-07-30","arxiv_id":"1707.09627","repositories_listed":1,"syntology":null},{"url":"/paper/p-tree-programming","slug":"p-tree-programming","title":"P-Tree Programming","date":"2017-07-12","arxiv_id":"1707.03744","repositories_listed":1,"syntology":null},{"url":"/paper/differentiable-functional-program","slug":"differentiable-functional-program","title":"Differentiable Functional Program Interpreters","date":"2016-11-07","arxiv_id":"1611.01988","repositories_listed":1,"syntology":null},{"url":null,"slug":"core-enhancing-metacognition-with-label-free","title":"CoRE: Enhancing Metacognition with Label-free Self-evaluation in LRMs","date":"2025-07-08","arxiv_id":"2507.06087","repositories_listed":0,"syntology":null},{"url":null,"slug":"structured-program-synthesis-using-llms","title":"Structured Program Synthesis using LLMs: Results and Insights from the IPARC Challenge","date":"2025-06-15","arxiv_id":"2506.13820","repositories_listed":0,"syntology":null},{"url":null,"slug":"matching-markets-meet-llms-algorithmic","title":"Matching Markets Meet LLMs: Algorithmic Reasoning with Ranked Preferences","date":"2025-06-04","arxiv_id":"2506.04478","repositories_listed":0,"syntology":null},{"url":null,"slug":"chemical-classification-program-synthesis","title":"Chemical classification program synthesis using generative artificial intelligence","date":"2025-05-24","arxiv_id":"2505.18470","repositories_listed":0,"syntology":null},{"url":null,"slug":"qimeng-xpiler-transcompiling-tensor-programs","title":"QiMeng-Xpiler: Transcompiling Tensor Programs for Deep Learning Systems with a Neural-Symbolic Approach","date":"2025-05-04","arxiv_id":"2505.02146","repositories_listed":0,"syntology":null},{"url":null,"slug":"gpu-accelerated-program-synthesis-enumerate","title":"GPU accelerated program synthesis: Enumerate semantics, not syntax!","date":"2025-04-26","arxiv_id":"2504.18943","repositories_listed":0,"syntology":null},{"url":null,"slug":"deqompile-quantum-circuit-decompilation-using","title":"DeQompile: quantum circuit decompilation using genetic programming for explainable quantum architecture search","date":"2025-04-11","arxiv_id":"2504.08310","repositories_listed":0,"syntology":null},{"url":null,"slug":"codearc-benchmarking-reasoning-capabilities","title":"CodeARC: Benchmarking Reasoning Capabilities of LLM Agents for Inductive Program Synthesis","date":"2025-03-29","arxiv_id":"2503.23145","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-world-models-for-bilevel","title":"Synthesizing world models for bilevel planning","date":"2025-03-26","arxiv_id":"2503.20124","repositories_listed":0,"syntology":null},{"url":null,"slug":"research-vision-multi-agent-path-planning-for","title":"Research Vision: Multi-Agent Path Planning for Cops And Robbers Via Reactive Synthesis","date":"2025-03-14","arxiv_id":"2503.11475","repositories_listed":0,"syntology":null},{"url":null,"slug":"shedding-light-in-task-decomposition-in","title":"Shedding Light in Task Decomposition in Program Synthesis: The Driving Force of the Synthesizer Model","date":"2025-03-11","arxiv_id":"2503.08738","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-empirical-comparison-of-cost-functions-in","title":"An Empirical Comparison of Cost Functions in Inductive Logic Programming","date":"2025-03-10","arxiv_id":"2503.07554","repositories_listed":0,"syntology":null},{"url":null,"slug":"fully-autonomous-programming-using-iterative","title":"Fully Autonomous Programming using Iterative Multi-Agent Debugging with Large Language Models","date":"2025-03-10","arxiv_id":"2503.07693","repositories_listed":0,"syntology":null},{"url":null,"slug":"machine-learning-meets-algebraic","title":"Machine Learning meets Algebraic Combinatorics: A Suite of Datasets Capturing Research-level Conjecturing Ability in Pure Mathematics","date":"2025-03-09","arxiv_id":"2503.06366","repositories_listed":0,"syntology":null},{"url":null,"slug":"visual-agentic-ai-for-spatial-reasoning-with","title":"Visual Agentic AI for Spatial Reasoning with a Dynamic API","date":"2025-02-10","arxiv_id":"2502.06787","repositories_listed":0,"syntology":null},{"url":null,"slug":"proving-the-coding-interview-a-benchmark-for","title":"Proving the Coding Interview: A Benchmark for Formally Verified Code Generation","date":"2025-02-08","arxiv_id":"2502.05714","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-semantics-aware-search-operators-for","title":"Learning Semantics-aware Search Operators for Genetic Programming","date":"2025-02-06","arxiv_id":"2502.04568","repositories_listed":0,"syntology":null},{"url":"/paper/qualityflow-an-agentic-workflow-for-program","slug":"qualityflow-an-agentic-workflow-for-program","title":"QualityFlow: An Agentic Workflow for Program Synthesis Controlled by LLM Quality Checks","date":"2025-01-20","arxiv_id":"2501.17167","repositories_listed":0,"syntology":null},{"url":null,"slug":"algopilot-fully-autonomous-program-synthesis","title":"AlgoPilot: Fully Autonomous Program Synthesis Without Human-Written Programs","date":"2025-01-11","arxiv_id":"2501.06423","repositories_listed":0,"syntology":null},{"url":null,"slug":"online-prompt-and-solver-selection-for","title":"Online Prompt Selection for Program Synthesis","date":"2025-01-09","arxiv_id":"2501.05247","repositories_listed":0,"syntology":null},{"url":null,"slug":"mmfactory-a-universal-solution-search-engine","title":"MMFactory: A Universal Solution Search Engine for Vision-Language Tasks","date":"2024-12-24","arxiv_id":"2412.18072","repositories_listed":0,"syntology":null}],"record_sha256":"fb90683a8c121dbb4da145cda1bd3170ed771d8655b3e6a208d1e9efce7b9f4e","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}