bump fourmolu and accept reformatting

Author: jberthold

booster/library/Booster/Builtin/LIST.hs

@@ -44,12 +44,12 @@ listGetHook [KList _ heads mbRest, intArg] =
                     if i < headLen
                         then pure $ Just $ heads !! i -- positive index in range
                         else -- headLen <= i
-                        case mbRest of
-                            Nothing ->
-                                -- index too large
-                                pure Nothing -- actually #Bottom
-                            Just _ ->
-                                pure Nothing
+                            case mbRest of
+                                Nothing ->
+                                    -- index too large
+                                    pure Nothing -- actually #Bottom
+                                Just _ ->
+                                    pure Nothing
                 | otherwise -> -- i < 0, negative index, consider rest
                     case mbRest of
                         Nothing

booster/library/Booster/Pattern/Implies.hs

@@ -130,7 +130,6 @@ runImplies def mLlvmLibrary mSMTOptions antecedent consequent =
                                         then -- we are being conservative here for now and returning an error.
                                         -- since we have already simplified the LHS, we may want to eventually return implise, but the condition
                                         -- will contain the remainder as an equality contraint, predicating the implication on that equality being true.
-
                                             pure . Left . RpcError.backendError . RpcError.ImplicationCheckError . RpcError.ErrorOnly . pack $
                                                 "match remainder: "
                                                     <> renderDefault
@@ -155,7 +154,6 @@ runImplies def mLlvmLibrary mSMTOptions antecedent consequent =
                                         (externaliseExistTerm existsR patR.term)
                                         subst
                                 else -- FIXME This is incomplete because patL.constraints are not assumed in the check.
-
                                     ApplyEquations.evaluateConstraints def mLlvmLibrary solver mempty filteredConsequentPreds >>= \case
                                         (Right newPreds, _) ->
                                             if all (== Predicate TrueBool) newPreds

booster/library/Booster/Pattern/Match.hs

@@ -399,7 +399,8 @@ matchSymbolAplications
                 then
                     failWith
                         (DifferentSymbols (SymbolApplication symbol1 sorts1 args1) (SymbolApplication symbol2 sorts2 args2))
-                else addIndeterminate (SymbolApplication symbol1 sorts1 args1) (SymbolApplication symbol2 sorts2 args2)
+                else
+                    addIndeterminate (SymbolApplication symbol1 sorts1 args1) (SymbolApplication symbol2 sorts2 args2)
         | length args1 /= length args2 =
             failWith $
                 ArgLengthsDiffer (SymbolApplication symbol1 sorts1 args1) (SymbolApplication symbol2 sorts2 args2)

kore/src/Kore/JsonRpc.hs

@@ -541,7 +541,6 @@ respond reqId serverState moduleName runSMT =
                             MVar.putMVar serverState $
                                 if nameAsId
                                     then -- the module already exists, but re-adding with name because name-as-id is true
-
                                         ServerState
                                             { serializedModules =
                                                 Map.insert (coerce name) foundSerModule serializedModules

kore/src/Kore/Log/InfoJsonRpcProcessRequest.hs

@@ -19,7 +19,8 @@ import Pretty (
  )
 import Pretty qualified
 
-data InfoJsonRpcProcessRequest = forall a.
+data InfoJsonRpcProcessRequest
+    = forall a.
       (Show a, Pretty a, Typeable a) =>
     InfoJsonRpcProcessRequest
     { requestId :: Id

kore/src/Kore/Simplify/Simplify.hs

@@ -456,8 +456,8 @@ It returns the result of simplifying the pattern with builtins and
 axioms, together with a proof certifying that it was simplified correctly
 (which is only a placeholder right now).
 -}
-newtype BuiltinAndAxiomSimplifier =
-    -- TODO (thomas.tuegel): Rename me!
+newtype BuiltinAndAxiomSimplifier
+    = -- TODO (thomas.tuegel): Rename me!
     BuiltinAndAxiomSimplifier
     { runBuiltinAndAxiomSimplifier ::
         TermLike RewritingVariableName ->

kore/src/Kore/Syntax/Pattern.hs

@@ -96,7 +96,8 @@ annotations.
 newtype
     Pattern
         (variable :: Type)
-        (annotation :: Type) = Pattern
+        (annotation :: Type)
+    = Pattern
     {getPattern :: Cofree (PatternF variable) annotation}
     deriving stock (Show)
     deriving stock (GHC.Generic)

kore/src/Kore/Unification/NewUnifier.hs

@@ -1186,8 +1186,10 @@ remakeMapTerms _ AcTerm{acElements = [var]} =
     mkElemVar $ fromJust $ retract var
 remakeMapTerms tools AcTerm{acElements, acSort} =
     if fromJust $ isMapSort tools acSort
-        then Ac.asInternal tools acSort $ NormalizedMap{getNormalizedMap = normalizedAc $ map mkVar acElements}
-        else Ac.asInternal tools acSort $ NormalizedSet{getNormalizedSet = normalizedAc $ map mkVar acElements}
+        then
+            Ac.asInternal tools acSort $ NormalizedMap{getNormalizedMap = normalizedAc $ map mkVar acElements}
+        else
+            Ac.asInternal tools acSort $ NormalizedSet{getNormalizedSet = normalizedAc $ map mkVar acElements}
   where
     normalizedAc opaque = NormalizedAc{elementsWithVariables = [], concreteElements = HashMap.empty, opaque}
 

scripts/fourmolu.sh

@@ -1,6 +1,6 @@
 #!/usr/bin/env bash
 set -euxo pipefail
-expected_fourmolu_version="0.14.0.0"
+expected_fourmolu_version="0.15.0.0"
 fourmolu=${FOURMOLU:-$(which fourmolu)} || { echo 'No fourmolu!' ; exit 1 ; }
 fourmolu_version=$(${fourmolu} --version | head -n1)
 # drop the prefix 'fourmolu ' which is 9 letters long