{"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/5","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,423],"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/papers/4","next":null,"papers":[{"url":null,"slug":"towards-mixed-optimization-for-reinforcement","title":"Towards Mixed Optimization for Reinforcement Learning with Program Synthesis","date":"2018-07-01","arxiv_id":"1807.00403","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-through-reinforcement","title":"Program Synthesis Through Reinforcement Learning Guided Tree Search","date":"2018-06-08","arxiv_id":"1806.02932","repositories_listed":0,"syntology":null},{"url":null,"slug":"program-synthesis-from-visual-specification","title":"Program Synthesis from Visual Specification","date":"2018-06-04","arxiv_id":"1806.00938","repositories_listed":0,"syntology":null},{"url":null,"slug":"egocoder-intelligent-program-synthesis-with","title":"EgoCoder: Intelligent Program Synthesis with Hierarchical Sequential Neural Network Model","date":"2018-05-22","arxiv_id":"1805.08747","repositories_listed":0,"syntology":null},{"url":null,"slug":"leveraging-grammar-and-reinforcement-learning","title":"Leveraging Grammar and Reinforcement Learning for Neural Program Synthesis","date":"2018-05-11","arxiv_id":"1805.04276","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-guided-deductive-search-for-real-time","title":"Neural-Guided Deductive Search for Real-Time Program Synthesis from Examples","date":"2018-04-03","arxiv_id":"1804.01186","repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-program-search-solving-programming","title":"Neural Program Search: Solving Programming Tasks from Description and Examples","date":"2018-02-12","arxiv_id":"1802.04335","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-synthesis-with-priority-queue-training","title":"Code Synthesis with Priority Queue Training","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"dynamic-neural-program-embeddings-for-program","title":"Dynamic Neural Program Embeddings for Program Repair","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-to-select-examples-for-program","title":"Learning to select examples for program synthesis","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"neural-program-search-solving-data-processing","title":"Neural Program Search: Solving Data Processing Tasks from Description and Examples","date":"2018-01-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"glass-box-program-synthesis-a-machine","title":"Glass-Box Program Synthesis: A Machine Learning Approach","date":"2017-09-25","arxiv_id":"1709.08669","repositories_listed":0,"syntology":null},{"url":null,"slug":"loopinvgen-a-loop-invariant-generator-based","title":"LoopInvGen: A Loop Invariant Generator based on Precondition Inference","date":"2017-07-07","arxiv_id":"1707.02029","repositories_listed":0,"syntology":null},{"url":null,"slug":"learning-disjunctions-of-predicates","title":"Learning Disjunctions of Predicates","date":"2017-06-15","arxiv_id":"1706.05070","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-synthesizing-complex-programs-from","title":"Towards Synthesizing Complex Programs from Input-Output Examples","date":"2017-06-05","arxiv_id":"1706.01284","repositories_listed":0,"syntology":null},{"url":null,"slug":"synthesizing-imperative-programs-from","title":"Synthesizing Imperative Programs from Examples Guided by Static Analysis","date":"2017-02-21","arxiv_id":"1702.06334","repositories_listed":0,"syntology":null},{"url":null,"slug":"summary-terpret-a-probabilistic-programming","title":"Summary - TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-12-02","arxiv_id":"1612.00817","repositories_listed":0,"syntology":null},{"url":null,"slug":"sampling-for-bayesian-program-learning","title":"Sampling for Bayesian Program Learning","date":"2016-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"time-series-structure-discovery-via","title":"Time Series Structure Discovery via Probabilistic Program Synthesis","date":"2016-11-21","arxiv_id":"1611.07051","repositories_listed":0,"syntology":null},{"url":null,"slug":"latent-attention-for-if-then-program","title":"Latent Attention For If-Then Program Synthesis","date":"2016-11-07","arxiv_id":"1611.01867","repositories_listed":0,"syntology":null},{"url":null,"slug":"neuro-symbolic-program-synthesis","title":"Neuro-Symbolic Program Synthesis","date":"2016-11-06","arxiv_id":"1611.01855","repositories_listed":0,"syntology":null},{"url":null,"slug":"terpret-a-probabilistic-programming-language","title":"TerpreT: A Probabilistic Programming Language for Program Induction","date":"2016-08-15","arxiv_id":"1608.04428","repositories_listed":0,"syntology":null},{"url":null,"slug":"unsupervised-learning-by-program-synthesis","title":"Unsupervised Learning by Program Synthesis","date":"2015-12-01","arxiv_id":null,"repositories_listed":0,"syntology":null}],"record_sha256":"30e012ee2a6866277308c64cf9aa29ce29a2f277257495866702625221fcd840","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}