GHC 9.8.2

Author: Unisay

flake.nix

@@ -19,7 +19,7 @@
           (final: prev: {
             psluaProject = final.haskell-nix.project' {
               src = ./.;
-              compiler-nix-name = "ghc964";
+              compiler-nix-name = "ghc98";
               evalSystem = "x86_64-linux";
               modules = let prof = false;
               in [{
@@ -34,11 +34,9 @@
               shell = {
                 tools = {
                   cabal = {};
-                  cabal-fmt = {};
                   fourmolu = {};
                   hlint = {};
                   haskell-language-server = {};
-                  nixfmt = {};
                 };
                 buildInputs = with pkgs; [
                   cachix

lib/Language/PureScript/CoreFn/Laziness.hs

@@ -30,8 +30,8 @@ import Language.PureScript.Names
   , pattern ByNullSourcePos
   )
 import Language.PureScript.PSString (mkString)
-import Relude.Unsafe qualified as Unsafe
 import Prelude hiding (force)
+import qualified Data.List.NonEmpty as NE
 
 -- This module is responsible for ensuring that the bindings in recursive
 -- binding groups are initialized in a valid order, introducing run-time
@@ -408,25 +408,27 @@ searchReachable
   ⇒ Int
   → ((Int, force) → m (IM.MonoidalIntMap (Max force)))
   → A.Array Int (m (IM.MonoidalIntMap (Max force)))
-searchReachable maxIdx lookupEdges = mrtFlatten . Unsafe.head <$> mem
+searchReachable maxIdx lookupEdges = mrtFlatten . head <$> mem
  where
   -- This is a finite array of infinite lists, used to memoize all the search
   -- trees. `unsafeHead` is used above to pull the first tree out of each list
   -- in the array--the one corresponding to zero force, which is what's needed
   -- to initialize the corresponding identifier. (`unsafeHead` is safe here, of
   -- course: infinite lists.)
-  mem ∷ A.Array Int [MaxRoseTree m force]
+  mem ∷ A.Array Int (NonEmpty (MaxRoseTree m force))
   mem =
     A.listArray
       (0, maxIdx)
-      [ [ cutLoops <*> fmap (IM.mapWithKey memoizedNode) . lookupEdges $ (i, f)
+      [ NE.fromList
+        [ cutLoops <*> fmap (IM.mapWithKey memoizedNode) . lookupEdges $ (i, f)
         | f ← [toEnum 0 ..]
         ]
       | i ← [0 .. maxIdx]
       ]
 
   memoizedNode ∷ Int → Max force → MaxRoseNode m force
-  memoizedNode i (Max force) = MaxRoseNode force $ mem A.! i !! fromEnum force
+  memoizedNode i (Max force) =
+    MaxRoseNode force $ toList (mem A.! i) !! fromEnum force
 
   -- And this is the function that prevents the search from actually being
   -- infinite. It applies a filter to a `MaxRoseTree` at every level, looking for

pslua.cabal

@@ -77,7 +77,7 @@ common shared
     , aeson                        ^>=2.2
     , array                        ^>=0.5.4.0
     , attoparsec                   ^>=0.14.4
-    , base                         ^>=4.18.2
+    , base                         ^>=4.19.1
     , containers                   ^>=0.6.5.1
     , data-fix                     ^>=0.3.2
     , deriving-compat              ^>=0.6.2
@@ -101,8 +101,8 @@ common shared
     , scientific                   ^>=0.3.7.0
     , string-interpolate           ^>=0.3.2.1
     , tagged                       ^>=0.8.6.1
-    , template-haskell             ^>=2.20
-    , text                         ^>=2.0.2
+    , template-haskell             ^>=2.21
+    , text                         ^>=2.1.1
     , transformers                 ^>=0.6.1.1
     , vector                       ^>=0.13
 
@@ -117,7 +117,7 @@ executable pslua
   build-depends:
     , optparse-applicative  ^>=0.18.1
     , pslua
-    , with-utf8             ^>=1.0.2.3
+    , with-utf8             ^>=1.1
 
 library
   import:          shared
@@ -183,12 +183,12 @@ test-suite spec
   build-depends:
     , call-stack                      ^>=0.4.0
     , exceptions                      ^>=0.10.7
-    , hedgehog                        ^>=1.2
+    , hedgehog                        ^>=1.4
     , hedgehog-corpus                 ^>=0.2
-    , hspec                           ^>=2.10.10
-    , hspec-core                      ^>=2.10.10
+    , hspec                           ^>=2.11.7
+    , hspec-core                      ^>=2.11.7
     , hspec-expectations-pretty-diff  ^>=0.7.2.6
-    , hspec-hedgehog                  ^>=0.0.1.2
+    , hspec-hedgehog                  ^>=0.1.1
     , HUnit                           ^>=1.6.2.0
     , pslua
     , typed-process                   ^>=0.2.10.1