diff --git a/CHANGELOG.md b/CHANGELOG.md
--- a/CHANGELOG.md
+++ b/CHANGELOG.md
@@ -1,5 +1,13 @@
 # Change Log
 
+## [v0.8.1](https://github.com/tweag/linear-base/tree/v0.8.1) (2026-06-24)
+
+[Full Changelog](https://github.com/tweag/linear-base/compare/v0.8.0...v0.8.1)
+
+### Headline changes
+
+- Restore compatibility with GHC 9.2: Import Multiplicity from GHC.Types [\#509](https://github.com/tweag/linear-base/pull/509) ([tomsmeding](https://github.com/tomsmeding))
+
 ## [v0.8.0](https://github.com/tweag/linear-base/tree/v0.8.0) (2026-05-12)
 
 [Full Changelog](https://github.com/tweag/linear-base/compare/v0.7.0...v0.8.0)
diff --git a/bench/Data/Mutable/HashMap.hs b/bench/Data/Mutable/HashMap.hs
--- a/bench/Data/Mutable/HashMap.hs
+++ b/bench/Data/Mutable/HashMap.hs
@@ -10,12 +10,7 @@
 {-# LANGUAGE ScopedTypeVariables #-}
 {-# LANGUAGE StandaloneDeriving #-}
 {-# LANGUAGE TupleSections #-}
-{-# OPTIONS_GHC -Wno-unused-imports #-}
 
--- `-Wno-unused-imports`: so that we can import `foldl'` without GHC 9.10+
--- complaining. Inelegant, but this is just a test file, not the end of the
--- world.
-
 module Data.Mutable.HashMap (benchmarks) where
 
 import Control.DeepSeq (NFData (..), deepseq, force)
@@ -27,7 +22,7 @@
 import qualified Data.HashTable.ST.Basic as BasicST
 import qualified Data.HashTable.ST.Cuckoo as CuckooST
 import Data.Hashable (Hashable (..), hashWithSalt)
-import Data.List (foldl')
+import qualified Data.List as List
 import qualified Data.Unrestricted.Linear as Linear
 import GHC.Generics (Generic)
 import qualified Prelude.Linear as Linear
@@ -204,7 +199,7 @@
       bench (descriptions !! n) $ nf (\xs -> f xs Map.empty) kvs
 
     foldlx :: (b -> a -> b) -> [a] -> b -> b
-    foldlx f xs b = foldl' f b xs
+    foldlx f xs b = List.foldl' f b xs
 
     look :: Map.HashMap Key Int -> Key -> Map.HashMap Key Int
     look m k = case m Map.!? k of
@@ -213,7 +208,7 @@
 
     bench1 :: Benchmark
     bench1 = mkBench 0 $
-      \xs hm -> foldl' (\m (k, v) -> Map.delete k (Map.insert k v m)) hm xs
+      \xs hm -> List.foldl' (\m (k, v) -> Map.delete k (Map.insert k v m)) hm xs
 
     bench2 :: Benchmark
     bench2 = mkBench 1 $
diff --git a/linear-base.cabal b/linear-base.cabal
--- a/linear-base.cabal
+++ b/linear-base.cabal
@@ -1,6 +1,6 @@
 cabal-version:      3.0
 name:               linear-base
-version:            0.8.0
+version:            0.8.1
 license:            MIT
 license-file:       LICENSE
 copyright:          (c) Tweag Holding and affiliates
diff --git a/src/Control/Functor/Linear/Internal/Reader.hs b/src/Control/Functor/Linear/Internal/Reader.hs
--- a/src/Control/Functor/Linear/Internal/Reader.hs
+++ b/src/Control/Functor/Linear/Internal/Reader.hs
@@ -35,7 +35,7 @@
 import Data.Kind (FUN)
 import Data.Unrestricted.Linear.Internal.Consumable
 import Data.Unrestricted.Linear.Internal.Dupable
-import GHC.Exts (Multiplicity (..))
+import GHC.Types (Multiplicity (..))
 import Prelude.Linear.Internal (runIdentity', ($), (.))
 
 -- # Linear ReaderT