Polishing partitions - Reimplementing a partitionOn
The code can be written cleaner if one removes the pred from go. go has access to all bindings in its context, including the ones in partitionOn pred list.

A first step to declutter partitionOn is therefore to get rid of duplication and get rid of unnecessary parentheses:

partitionOn :: ([a] -&gt; Bool) -&gt; [a] -&gt; [[a]]
partitionOn pred list = go pred [] list 
    where
        go working [] = [working]
        go working l@(x:xs) = if pred working
                then working : go [] l
                else go (working ++ [x]) xs


Note that I've removed go's type signature. This is somewhat controversial, but the general rule-of-thumb is that you want type signatures at the top-level and usually leave the type-signatures at the not-top level, unless GHC gets confused.

The (small) problem with type signatures in where and let is that the type parameter a in parititionOn is not the same as the one in go. -XScopedTypeVariables is necessary for that. So lets get rid of that.


  Would it be cleaner to use the following go?


No. Or rather: it would be slightly cleaner, but pred also needs to work on the reversed list. This is more obvious if we don't use a position-independent predicate:

notInOrder []           = False
notInOrder (x:xs@(y:_)) = x &gt; y || notInOrder xs


Your old version returns [1..10] on partitionOn notInOrder [1..10], but your new one returns [[1],[2],[3],…,[10]], unless you also check pred (reverse working).

Therefore&mdash;At least in the sense of asymptotic analysis&mdash;both variants will have the same performance.


  Am I missing a special case of groupBy here? It feels like there should be a simple standard function to do this.


The standard functions for splitting lists at some point are span, break, splitAt, take(While), drop(While(End)), group(By), inits and tails. They all are concerned with a single element in their predicate, so they are not candidates for our problem, unless we already have our splits:

splits :: [a] -&gt; [([a],[a])]
splits xs = zip (inits xs) (tails xs)


That function does not exist, though. A perfect building block for partitionOn would have the type signature ([a] -&gt; Bool) -&gt; [a] -&gt; ([a],[a]), but that's missing from the standard library. Others packages provide functions with that signature, but none does provide our needed functionality.

But we can write that function ourself:

breakAcc :: ([a] -&gt; Bool) -&gt; [a] -&gt; ([a],[a])
breakAcc p = go []
  where
    go ys []     = if p ys then (ys,[]) else ([],ys)
    go ys (x:xs) = if p ys then (ys, xs)
                           else go (ys ++ [x]) xs

-- or, using `splits` above:

breakAcc p xs = case find (p . fst) (splits xs) of
                 Just ys -&gt; ys
                 Nothing -&gt; ([], xs)


Note that the first variant still has the somewhat awkward ++ [x] there. A partition that starts from the right wouldn't have that problem, but we're stuck with that.

Now partitionOn is just

-- feel free to use a worker wrapper approach here
partitionOn p xs = case spanAcc p xs of
              ([],bs) -&gt; [bs]
              (as,bs) -&gt; as : partitionOn p bs


Note that this will add the empty list at the end if our partition works for all elements, e.g. partitionOn ((0 &lt;) . sum) [1..4] == [[1],[2],[3],[4],[]]. But that's easy to get rid of.

All at once:

import Data.List (inits, tails, find)

splits :: [a] -&gt; [([a],[a])]
splits xs = zip (inits xs) (tails xs)

breakAcc :: ([a] -&gt; Bool) -&gt; [a] -&gt; ([a],[a])
breakAcc p xs = case find (p . fst) (splits xs) of
                  Just ps -&gt; ps
                  Nothing -&gt; ([],xs)

partitionOn :: ([a] -&gt; Bool) -&gt; [a] -&gt; [[a]]
partitionOn p xs = case breakAcc p xs of
                     ([],bs) -&gt; [bs]
                     (as,bs) -&gt; as : partitionOn p bs

-- for QuickCheck
partitionOnResult_prop :: ([a] -&gt; Bool) -&gt; [[a]] -&gt; Bool
partitionOnResult_prop p xs = all p (init xs)

partitionOn_prop :: ([a] -&gt; Bool) -&gt; [a] -&gt; Bool
partitionOn_prop p xs = partitionOnResult_prop p (partitionOn p xs)

-- quickCheck $ \(Blind p) -&gt; partitionOn_prop p


Now that we have all of this code, let's compare it again with your (almost) original variant:

partitionOn :: ([a] -&gt; Bool) -&gt; [a] -&gt; [[a]]
partitionOn pred list = go pred [] list 
    where
        go working [] = [working]
        go working l@(x:xs) = if pred working
                then working : go [] l
                else go (working ++ [x]) xs


If we quint our eyes, both codes look the same (if we use the first breakAcc variant). However, I wouldn't call a list l, since lists are usually identified with a suffix s called e.g. ls. Also, working is somewhat of a misnomer: are we working with that list? Or does that list fulfill some requirement? As we currently accumulate elements in there, the usual acc or accs might be better, but naming is hard and left as an exercise.

Other than that, unless you want to have little, test-able functions, your original variant was therefore fine to begin with, but contained some functions that can be re-used.