diff --git a/laws/src/main/scala/cats/laws/ApplicativeErrorLaws.scala b/laws/src/main/scala/cats/laws/ApplicativeErrorLaws.scala
index c6b21eeef37..93b8c41f2f6 100644
--- a/laws/src/main/scala/cats/laws/ApplicativeErrorLaws.scala
+++ b/laws/src/main/scala/cats/laws/ApplicativeErrorLaws.scala
@@ -65,7 +65,7 @@ trait ApplicativeErrorLaws[F[_], E] extends ApplicativeLaws[F] {
     F.onError(F.pure(a)) { case x => f(x) } <-> F.pure(a)
 
   def onErrorRaise[A](fa: F[A], e: E, fb: F[Unit]): IsEq[F[A]] =
-    F.onError(F.raiseError[A](e)) { case err => fb } <-> F.map2(fb, F.raiseError[A](e))((_, b) => b)
+    F.onError(F.raiseError[A](e)) { case _ => fb } <-> F.map2(fb, F.raiseError[A](e))((_, b) => b)
 
   def adaptErrorPure[A](a: A, f: E => E): IsEq[F[A]] =
     F.adaptError(F.pure(a)) { case x => f(x) } <-> F.pure(a)
diff --git a/laws/src/main/scala/cats/laws/DeferLaws.scala b/laws/src/main/scala/cats/laws/DeferLaws.scala
index d56ab6a8712..ab9118743a2 100644
--- a/laws/src/main/scala/cats/laws/DeferLaws.scala
+++ b/laws/src/main/scala/cats/laws/DeferLaws.scala
@@ -35,7 +35,7 @@ trait DeferLaws[F[_]] {
 
   def deferDoesNotEvaluate[A](fa: Unit => F[A]): IsEq[Boolean] = {
     var evaluated = false
-    val deferUnit = F.defer {
+    val _ = F.defer {
       evaluated = true;
       fa(())
     }
diff --git a/laws/src/main/scala/cats/laws/ShortCircuitingLaws.scala b/laws/src/main/scala/cats/laws/ShortCircuitingLaws.scala
index 5105890172f..436910088a2 100644
--- a/laws/src/main/scala/cats/laws/ShortCircuitingLaws.scala
+++ b/laws/src/main/scala/cats/laws/ShortCircuitingLaws.scala
@@ -35,7 +35,7 @@ trait ShortCircuitingLaws[F[_]] {
   def foldMapKShortCircuits[A](fa: F[A], empty: A)(implicit F: Foldable[F]): IsEq[Long] = {
     val size = fa.size
     val maxInvocationsAllowed = size / 2
-    val f = new RestrictedFunction[A, Option[A]]((a: A) => None, maxInvocationsAllowed, Some(empty))
+    val f = new RestrictedFunction[A, Option[A]]((_: A) => None, maxInvocationsAllowed, Some(empty))
 
     fa.foldMapK(f)
     f.invocations.get <-> (maxInvocationsAllowed + 1).min(size)
@@ -44,7 +44,7 @@ trait ShortCircuitingLaws[F[_]] {
   def foldMapKWontShortCircuit[A](fa: F[A], empty: A)(implicit F: Foldable[F]): IsEq[Long] = {
     val size = fa.size
     val maxInvocationsAllowed = size / 2
-    val f = new RestrictedFunction[A, Option[A]]((a: A) => None, maxInvocationsAllowed, Some(empty))
+    val f = new RestrictedFunction[A, Option[A]]((_: A) => None, maxInvocationsAllowed, Some(empty))
 
     fa.foldMapK(f)(F, nonShortCircuitingMonoidK)
     f.invocations.get <-> size