mixphix

@chreekat Unfortunately not, I was forbidden from emailing the ghc-devs mailing list and received no response from ghc-devs-owner.

I've sent you an email.

I was able to log in and set up 2FA again. Thanks @chreekat and @Bodigrim. I've left a comment on the MR thread as well.

After compiling as much of `clc-stackage` as I could with the GHC using the changes from this MR, I found 27 ambiguities in 14 packages: - [Agda](https://hackage.haskell.org/package/Agda) - [BNFC](https://hackage.haskell.org/package/BNFC) -...

I am still not able to compile a full working version of `clc-stackage` with the GHC 9.8 produced from altering the `Prelude`, due to more errors from the constraint solver...

`foldMap` can be more efficient than either `foldl` or `foldr`, so `Unit` was added by #106 (same as UnitLTR).

-1. Just use `toList` if you're comfortable using `NonEmpty`.

Excuse me? ```hs ghci> :m +Data.Foldable Data.List Data.List.NonEmpty -- 1 ghci> Data.List.tails [1, 2, 3, 4] [[1,2,3,4],[2,3,4],[3,4],[4],[]] -- 2 ghci> Data.List.NonEmpty.tails (1 :| [2, 3, 4]) [1,2,3,4] :| [[2,3,4],[3,4],[4],[]] --...

`mapMaybe nonEmpty . Data.List.tails` This is not primitive, not useful, and not hard to get by without.

Thanks for the exposition, @Bodigrim. I've come around on this proposal. +1