[ty] Fix stack overflow with recursive type aliases containing tuple …#22543
Merged
[ty] Fix stack overflow with recursive type aliases containing tuple …#22543
Conversation
Diagnostic diff on typing conformance testsNo changes detected when running ty on typing conformance tests ✅ |
|
mtshiba
approved these changes
Jan 13, 2026
Contributor
Author
…types This fixes issue #2470 where recursive type aliases like `type RecursiveT = int | tuple[RecursiveT, ...]` caused a stack overflow when used in return type checking with constructors like `list()`. The fix moves all type mapping processing for `UniqueSpecialization` (and other non-EagerExpansion mappings) inside the `visitor.visit()` closure. This ensures that if we encounter the same TypeAlias recursively during type mapping, the cycle detector will properly detect it and return the fallback value instead of recursing infinitely. The key insight is that the previous code called `apply_function_specialization` followed by another `apply_type_mapping_impl` AFTER the visitor closure returned. At that point, the TypeAlias was no longer in the visitor's `seen` set, so recursive references would not be detected as cycles.
b1867d8 to
2327cb3
Compare
AlexWaygood
pushed a commit
that referenced
this pull request
Jan 14, 2026
#22543) This fixes issue #2470 where recursive type aliases like `type RecursiveT = int | tuple[RecursiveT, ...]` caused a stack overflow when used in return type checking with constructors like `list()`. The fix moves all type mapping processing for `UniqueSpecialization` (and other non-EagerExpansion mappings) inside the `visitor.visit()` closure. This ensures that if we encounter the same TypeAlias recursively during type mapping, the cycle detector will properly detect it and return the fallback value instead of recursing infinitely. The key insight is that the previous code called `apply_function_specialization` followed by another `apply_type_mapping_impl` AFTER the visitor closure returned. At that point, the TypeAlias was no longer in the visitor's `seen` set, so recursive references would not be detected as cycles.
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This fixes issue astral-sh/ty#2470 where recursive type aliases like
type RecursiveT = int | tuple[RecursiveT, ...]caused a stack overflow when used in return type checking with constructors likelist().The fix moves all type mapping processing for
UniqueSpecialization(and other non-EagerExpansion mappings) inside thevisitor.visit()closure. This ensures that if we encounter the same TypeAlias recursively during type mapping, the cycle detector will properly detect it and return the fallback value instead of recursing infinitely.The key insight is that the previous code called
apply_function_specializationfollowed by anotherapply_type_mapping_implAFTER the visitor closure returned. At that point, the TypeAlias was no longer in the visitor'sseenset, so recursive references would not be detected as cycles.