
abstract_refinement_hole_fits.hs:4:5: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
    • Found hole: _ :: [Integer] -> Integer
    • In an equation for ‘f’: f = _
    • Relevant bindings include
        f :: [Integer] -> Integer
          (bound at abstract_refinement_hole_fits.hs:4:1)
      Valid hole fits include
        f :: [Integer] -> Integer
        g :: [Integer] -> Integer
        head :: forall a. GHC.Internal.Stack.Types.HasCallStack => [a] -> a
        last :: forall a. GHC.Internal.Stack.Types.HasCallStack => [a] -> a
        maximum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
        minimum :: forall (t :: * -> *) a. (Foldable t, Ord a) => t a -> a
        product :: forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
        sum :: forall (t :: * -> *) a. (Foldable t, Num a) => t a -> a
      Valid refinement hole fits include
        foldl1 (_ :: Integer -> Integer -> Integer)
          where foldl1 :: forall (t :: * -> *) a.
                          Foldable t =>
                          (a -> a -> a) -> t a -> a
        foldr1 (_ :: Integer -> Integer -> Integer)
          where foldr1 :: forall (t :: * -> *) a.
                          Foldable t =>
                          (a -> a -> a) -> t a -> a
        foldl (_ :: Integer -> Integer -> Integer) (_ :: Integer)
          where foldl :: forall (t :: * -> *) b a.
                         Foldable t =>
                         (b -> a -> b) -> b -> t a -> b
        foldl' (_ :: Integer -> Integer -> Integer) (_ :: Integer)
          where foldl' :: forall (t :: * -> *) b a.
                          Foldable t =>
                          (b -> a -> b) -> b -> t a -> b
        foldr (_ :: Integer -> Integer -> Integer) (_ :: Integer)
          where foldr :: forall (t :: * -> *) a b.
                         Foldable t =>
                         (a -> b -> b) -> b -> t a -> b
        const (_ :: Integer)
          where const :: forall a b. a -> b -> a
        (.) (_ :: b1 -> Integer) (_ :: [Integer] -> b1)
          where (.) :: forall b c a. (b -> c) -> (a -> b) -> a -> c
        flip (_ :: [Integer] -> t0 -> Integer) (_ :: t0)
          where flip :: forall a b c. (a -> b -> c) -> b -> a -> c
        curry (_ :: (t0, [Integer]) -> Integer) (_ :: t0)
          where curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
        ($) (_ :: [Integer] -> Integer)
          where ($) :: forall a b. (a -> b) -> a -> b
        ($!) (_ :: [Integer] -> Integer)
          where ($!) :: forall a b. (a -> b) -> a -> b
        id (_ :: t0 -> [Integer] -> Integer) (_ :: t0)
          where id :: forall a. a -> a
        head (_ :: [t0 -> [Integer] -> Integer]) (_ :: t0)
          where head :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        last (_ :: [t0 -> [Integer] -> Integer]) (_ :: t0)
          where last :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        fst (_ :: (t0 -> [Integer] -> Integer, b2)) (_ :: t0)
          where fst :: forall a b. (a, b) -> a
        snd (_ :: (a3, t0 -> [Integer] -> Integer)) (_ :: t0)
          where snd :: forall a b. (a, b) -> b
        return (_ :: Integer)
          where return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure (_ :: Integer)
          where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
        (>>=) (_ :: [Integer] -> a6) (_ :: a6 -> [Integer] -> Integer)
          where (>>=) :: forall (m :: * -> *) a b.
                         Monad m =>
                         m a -> (a -> m b) -> m b
        (>>) (_ :: [Integer] -> a5) (_ :: [Integer] -> Integer)
          where (>>) :: forall (m :: * -> *) a b.
                        Monad m =>
                        m a -> m b -> m b
        fmap (_ :: a7 -> Integer) (_ :: [Integer] -> a7)
          where fmap :: forall (f :: * -> *) a b.
                        Functor f =>
                        (a -> b) -> f a -> f b
        (<*>) (_ :: [Integer] -> a9 -> Integer) (_ :: [Integer] -> a9)
          where (<*>) :: forall (f :: * -> *) a b.
                         Applicative f =>
                         f (a -> b) -> f a -> f b
        (*>) (_ :: [Integer] -> a8) (_ :: [Integer] -> Integer)
          where (*>) :: forall (f :: * -> *) a b.
                        Applicative f =>
                        f a -> f b -> f b
        (=<<) (_ :: a1 -> [Integer] -> Integer) (_ :: [Integer] -> a1)
          where (=<<) :: forall (m :: * -> *) a b.
                         Monad m =>
                         (a -> m b) -> m a -> m b
        (<$>) (_ :: a2 -> Integer) (_ :: [Integer] -> a2)
          where (<$>) :: forall (f :: * -> *) a b.
                         Functor f =>
                         (a -> b) -> f a -> f b
        (<*) (_ :: [Integer] -> Integer) (_ :: [Integer] -> b4)
          where (<*) :: forall (f :: * -> *) a b.
                        Applicative f =>
                        f a -> f b -> f a
        (<$) (_ :: Integer) (_ :: [Integer] -> b5)
          where (<$) :: forall (f :: * -> *) a b.
                        Functor f =>
                        a -> f b -> f a
        id (_ :: [Integer] -> Integer)
          where id :: forall a. a -> a
        head (_ :: [[Integer] -> Integer])
          where head :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        last (_ :: [[Integer] -> Integer])
          where last :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        asTypeOf (_ :: [Integer] -> Integer) (_ :: [Integer] -> Integer)
          where asTypeOf :: forall a. a -> a -> a
        (!!) (_ :: [[Integer] -> Integer]) (_ :: Int)
          where (!!) :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> Int -> a
        fst (_ :: ([Integer] -> Integer, b0))
          where fst :: forall a b. (a, b) -> a
        snd (_ :: (a0, [Integer] -> Integer))
          where snd :: forall a b. (a, b) -> b
        const (_ :: [Integer] -> Integer) (_ :: t0)
          where const :: forall a b. a -> b -> a
        uncurry (_ :: a4 -> b3 -> [Integer] -> Integer) (_ :: (a4, b3))
          where uncurry :: forall a b c. (a -> b -> c) -> (a, b) -> c
        seq (_ :: t2) (_ :: [Integer] -> Integer)
          where seq :: forall a b. a -> b -> b
        ($!) (_ :: t0 -> [Integer] -> Integer) (_ :: t0)
          where ($!) :: forall a b. (a -> b) -> a -> b
        ($) (_ :: t0 -> [Integer] -> Integer) (_ :: t0)
          where ($) :: forall a b. (a -> b) -> a -> b
        return (_ :: [Integer] -> Integer) (_ :: t0)
          where return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure (_ :: [Integer] -> Integer) (_ :: t0)
          where pure :: forall (f :: * -> *) a. Applicative f => a -> f a

abstract_refinement_hole_fits.hs:7:5: warning: [GHC-88464] [-Wtyped-holes (in -Wdefault)]
    • Found hole: _ :: Integer -> [Integer] -> Integer
    • In the expression: _ 0
      In an equation for ‘g’: g = _ 0
    • Relevant bindings include
        g :: [Integer] -> Integer
          (bound at abstract_refinement_hole_fits.hs:7:1)
      Valid hole fits include
        const :: forall a b. a -> b -> a
        return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure :: forall (f :: * -> *) a. Applicative f => a -> f a
      Valid refinement hole fits include
        foldl (_ :: Integer -> Integer -> Integer)
          where foldl :: forall (t :: * -> *) b a.
                         Foldable t =>
                         (b -> a -> b) -> b -> t a -> b
        foldl' (_ :: Integer -> Integer -> Integer)
          where foldl' :: forall (t :: * -> *) b a.
                          Foldable t =>
                          (b -> a -> b) -> b -> t a -> b
        foldr (_ :: Integer -> Integer -> Integer)
          where foldr :: forall (t :: * -> *) a b.
                         Foldable t =>
                         (a -> b -> b) -> b -> t a -> b
        flip (_ :: [Integer] -> Integer -> Integer)
          where flip :: forall a b c. (a -> b -> c) -> b -> a -> c
        curry (_ :: (Integer, [Integer]) -> Integer)
          where curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
        const (_ :: [Integer] -> Integer)
          where const :: forall a b. a -> b -> a
        (.) (_ :: b1 -> [Integer] -> Integer) (_ :: Integer -> b1)
          where (.) :: forall b c a. (b -> c) -> (a -> b) -> a -> c
        flip (_ :: Integer -> t0 -> [Integer] -> Integer) (_ :: t0)
          where flip :: forall a b c. (a -> b -> c) -> b -> a -> c
        curry (_ :: (t0, Integer) -> [Integer] -> Integer) (_ :: t0)
          where curry :: forall a b c. ((a, b) -> c) -> a -> b -> c
        ($) (_ :: Integer -> [Integer] -> Integer)
          where ($) :: forall a b. (a -> b) -> a -> b
        ($!) (_ :: Integer -> [Integer] -> Integer)
          where ($!) :: forall a b. (a -> b) -> a -> b
        id (_ :: t0 -> Integer -> [Integer] -> Integer) (_ :: t0)
          where id :: forall a. a -> a
        head (_ :: [t0 -> Integer -> [Integer] -> Integer]) (_ :: t0)
          where head :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        last (_ :: [t0 -> Integer -> [Integer] -> Integer]) (_ :: t0)
          where last :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        fst (_ :: (t0 -> Integer -> [Integer] -> Integer, b2)) (_ :: t0)
          where fst :: forall a b. (a, b) -> a
        snd (_ :: (a3, t0 -> Integer -> [Integer] -> Integer)) (_ :: t0)
          where snd :: forall a b. (a, b) -> b
        return (_ :: [Integer] -> Integer)
          where return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure (_ :: [Integer] -> Integer)
          where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
        (>>=) (_ :: Integer -> a6)
              (_ :: a6 -> Integer -> [Integer] -> Integer)
          where (>>=) :: forall (m :: * -> *) a b.
                         Monad m =>
                         m a -> (a -> m b) -> m b
        (>>) (_ :: Integer -> a5) (_ :: Integer -> [Integer] -> Integer)
          where (>>) :: forall (m :: * -> *) a b.
                        Monad m =>
                        m a -> m b -> m b
        fmap (_ :: a7 -> [Integer] -> Integer) (_ :: Integer -> a7)
          where fmap :: forall (f :: * -> *) a b.
                        Functor f =>
                        (a -> b) -> f a -> f b
        (<*>) (_ :: Integer -> a9 -> [Integer] -> Integer)
              (_ :: Integer -> a9)
          where (<*>) :: forall (f :: * -> *) a b.
                         Applicative f =>
                         f (a -> b) -> f a -> f b
        (*>) (_ :: Integer -> a8) (_ :: Integer -> [Integer] -> Integer)
          where (*>) :: forall (f :: * -> *) a b.
                        Applicative f =>
                        f a -> f b -> f b
        (=<<) (_ :: a1 -> Integer -> [Integer] -> Integer)
              (_ :: Integer -> a1)
          where (=<<) :: forall (m :: * -> *) a b.
                         Monad m =>
                         (a -> m b) -> m a -> m b
        (<$>) (_ :: a2 -> [Integer] -> Integer) (_ :: Integer -> a2)
          where (<$>) :: forall (f :: * -> *) a b.
                         Functor f =>
                         (a -> b) -> f a -> f b
        (<*) (_ :: Integer -> [Integer] -> Integer) (_ :: Integer -> b4)
          where (<*) :: forall (f :: * -> *) a b.
                        Applicative f =>
                        f a -> f b -> f a
        (<$) (_ :: [Integer] -> Integer) (_ :: Integer -> b5)
          where (<$) :: forall (f :: * -> *) a b.
                        Functor f =>
                        a -> f b -> f a
        id (_ :: Integer -> [Integer] -> Integer)
          where id :: forall a. a -> a
        head (_ :: [Integer -> [Integer] -> Integer])
          where head :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        last (_ :: [Integer -> [Integer] -> Integer])
          where last :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> a
        asTypeOf (_ :: Integer -> [Integer] -> Integer)
                 (_ :: Integer -> [Integer] -> Integer)
          where asTypeOf :: forall a. a -> a -> a
        (!!) (_ :: [Integer -> [Integer] -> Integer]) (_ :: Int)
          where (!!) :: forall a.
                        GHC.Internal.Stack.Types.HasCallStack =>
                        [a] -> Int -> a
        fst (_ :: (Integer -> [Integer] -> Integer, b0))
          where fst :: forall a b. (a, b) -> a
        snd (_ :: (a0, Integer -> [Integer] -> Integer))
          where snd :: forall a b. (a, b) -> b
        const (_ :: Integer -> [Integer] -> Integer) (_ :: t0)
          where const :: forall a b. a -> b -> a
        uncurry (_ :: a4 -> b3 -> Integer -> [Integer] -> Integer)
                (_ :: (a4, b3))
          where uncurry :: forall a b c. (a -> b -> c) -> (a, b) -> c
        seq (_ :: t2) (_ :: Integer -> [Integer] -> Integer)
          where seq :: forall a b. a -> b -> b
        ($!) (_ :: t0 -> Integer -> [Integer] -> Integer) (_ :: t0)
          where ($!) :: forall a b. (a -> b) -> a -> b
        ($) (_ :: t0 -> Integer -> [Integer] -> Integer) (_ :: t0)
          where ($) :: forall a b. (a -> b) -> a -> b
        return (_ :: Integer -> [Integer] -> Integer) (_ :: t0)
          where return :: forall (m :: * -> *) a. Monad m => a -> m a
        pure (_ :: Integer -> [Integer] -> Integer) (_ :: t0)
          where pure :: forall (f :: * -> *) a. Applicative f => a -> f a
