{"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/code-completion/papers/3","list_of":"/task/code-completion","task":"Code Completion","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":3,"pages_in_order":3,"rows_per_page":100,"rows":[201,212],"of":212,"counts":{"archive_papers_tagged":212,"with_a_code_link":108,"where_syntology_ran_a_sample":42,"not_listed_spam_title":0,"listed":212,"listed_where_code_ran":42,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":34,"every_run_a_failure_of_syntologys_instrument":8,"listed_with_a_run_with_no_instrument_failure":34,"listed_every_run_a_failure_of_syntologys_instrument":8,"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/code-completion","prev":"/task/code-completion/papers/2","next":null,"papers":[{"url":null,"slug":"code-completion-by-modeling-flattened","title":"Code Completion by Modeling Flattened Abstract Syntax Trees as Graphs","date":"2021-03-17","arxiv_id":"2103.09499","repositories_listed":0,"syntology":null},{"url":null,"slug":"towards-full-line-code-completion-with-neural","title":"Towards Full-line Code Completion with Neural Language Models","date":"2020-09-18","arxiv_id":"2009.08603","repositories_listed":0,"syntology":null},{"url":null,"slug":"you-autocomplete-me-poisoning-vulnerabilities","title":"You Autocomplete Me: Poisoning Vulnerabilities in Neural Code Completion","date":"2020-07-05","arxiv_id":"2007.02220","repositories_listed":0,"syntology":null},{"url":null,"slug":"intellicode-compose-code-generation-using","title":"IntelliCode Compose: Code Generation Using Transformer","date":"2020-05-16","arxiv_id":"2005.08025","repositories_listed":0,"syntology":null},{"url":null,"slug":"fast-and-memory-efficient-neural-code","title":"Fast and Memory-Efficient Neural Code Completion","date":"2020-04-28","arxiv_id":"2004.13651","repositories_listed":0,"syntology":null},{"url":null,"slug":"code-completion-using-neural-attention-and","title":"Code Completion using Neural Attention and Byte Pair Encoding","date":"2020-04-14","arxiv_id":"2004.06343","repositories_listed":0,"syntology":null},{"url":null,"slug":"sequence-model-design-for-code-completion-in","title":"Sequence Model Design for Code Completion in the Modern IDE","date":"2020-04-10","arxiv_id":"2004.05249","repositories_listed":0,"syntology":null},{"url":null,"slug":"deepvs-an-efficient-and-generic-approach-for","title":"DeepVS: An Efficient and Generic Approach for Source Code Modeling Usage","date":"2019-10-15","arxiv_id":"1910.06500","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-self-attentional-neural-architecture-for","title":"A Self-Attentional Neural Architecture for Code Completion with Multi-Task Learning","date":"2019-09-16","arxiv_id":"1909.06983","repositories_listed":0,"syntology":null},{"url":null,"slug":"user-interactive-machine-learning-model-for","title":"User-Interactive Machine Learning Model for Identifying Structural Relationships of Code Features","date":"2019-07-18","arxiv_id":"1907.07679","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":"augur-a-modeling-language-for-data-parallel","title":"Augur: a Modeling Language for Data-Parallel Probabilistic Inference","date":"2013-12-12","arxiv_id":"1312.3613","repositories_listed":0,"syntology":null}],"record_sha256":"671e2309d6f3ee9ce2b16e9878a6374efca9c78891861be03fb03a2c0cea6388","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}