Papers › TypeT5: Seq2seq Type Inference using Static Analysis

TypeT5: Seq2seq Type Inference using Static Analysis

16 Mar 2023arXiv:2303.09564archive 2025-07-28

Jiayi Wei, Greg Durrett, Isil Dillig

There has been growing interest in automatically predicting missing type annotations in programs written in Python and JavaScript. While prior methods have achieved impressive accuracy when predicting the most common types, they often perform poorly on rare or complex types. In this paper, we present a new type inference method that treats type prediction as a code infilling task by leveraging CodeT5, a state-of-the-art seq2seq pre-trained language model for code. Our method uses static analysis to construct dynamic contexts for each code element whose type signature is to be predicted by the model. We also propose an iterative decoding scheme that incorporates previous type predictions in the model's input context, allowing information exchange between related code elements. Our evaluation shows that the proposed approach, TypeT5, not only achieves a higher overall accuracy (particularly on rare and complex types) but also produces more coherent results with fewer type errors -- while enabling easy user intervention.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2303.09564")

Code

Syntology Ran 0 of 7 code samples harvested from 1 repository linked to this paper; 7 have no recorded run.

By repository: official repository: 7 samples from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

utopia-group/typet5 officialmentioned in paperpytorchBSD-3-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

7 samples harvested; 0 ran; 0 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

7unverified

Licence: 0 of the 7 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from utopia-group/typet5. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

dynamic_dataloader utopia-group/typet5/src/typet5/model.py official repository unverified BSD-3-Clause (permissive) · 6ba8079246a34897 · report
get_config utopia-group/typet5/src/typet5/utils.py official repository unverified BSD-3-Clause (permissive) · e6717dddf0d23b04 · report
get_dataset_dir utopia-group/typet5/src/typet5/utils.py official repository unverified BSD-3-Clause (permissive) · 1650108633cf4fd4 · report
get_gpu_id utopia-group/typet5/src/typet5/utils.py official repository unverified BSD-3-Clause (permissive) · 2025e986eb5cbc67 · report
normalize_type_head utopia-group/typet5/src/typet5/type_check.py official repository unverified BSD-3-Clause (permissive) · 15011ab85eff80c6 · report
normalize_type_name utopia-group/typet5/src/typet5/type_check.py official repository unverified BSD-3-Clause (permissive) · 83883cff92651591 · report
wrap_main_code utopia-group/typet5/src/typet5/function_dataset.py official repository unverified BSD-3-Clause (permissive) · ec70a4adfdbf766c · report

Tasks

Language ModelingLanguage ModellingType predictionVocal Bursts Type Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AdafactorAttentionAttention DropoutBPEDense ConnectionsDropoutGated Linear UnitInverse Square Root ScheduleLSTMLayer NormalizationLinear LayerMulti-Head AttentionResidual ConnectionSentencePieceSeq2SeqSigmoid ActivationSoftmaxT5Tanh Activation

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections