diff --git a/crates/ty_python_semantic/src/types/unification.rs b/crates/ty_python_semantic/src/types/unification.rs
index 2bcf605d10..f39e7d8b28 100644
--- a/crates/ty_python_semantic/src/types/unification.rs
+++ b/crates/ty_python_semantic/src/types/unification.rs
@@ -152,7 +152,7 @@ impl<'db> ConstraintSetSet<'db> {
                 // (or the coinductive base case).
                 if self.results.contains_key(&ty) {
                     return;
-                };
+                }
 
                 // Figure 3, step 1: Insert the coinductive base case for this type into the result
                 // set. That ensures that if we encounter this type again recursively while we are
diff --git a/crates/ty_python_semantic/src/types/visitor.rs b/crates/ty_python_semantic/src/types/visitor.rs
index 9a64db1344..aabefbfd0b 100644
--- a/crates/ty_python_semantic/src/types/visitor.rs
+++ b/crates/ty_python_semantic/src/types/visitor.rs
@@ -203,7 +203,7 @@ impl<'db> From<Type<'db>> for TypeKind<'db> {
     }
 }
 
-impl<'db> Type<'db> {
+impl Type<'_> {
     pub(crate) fn is_atomic(self) -> bool {
         matches!(TypeKind::from(self), TypeKind::Atomic)
     }