Being introduced to Miranda was a revelation to me back in the day. I still prefer aspects of Miranda syntax over Haskell. For example, the formatting of guards in Miranda:

  gcd a b = gcd (a-b) b, if a>b
          = gcd a (b-a), if a<b
          = a,           if a=b

versus Haskell

  gcd a b | a>b  = gcd (a-b) b
          | a<b  = gcd a (b-a)
          | a==b = a

I know it's a small thing and you can get used to such differences but since FP became just an occasional side interest for me, I never made the switch as a heavyish Miranda user to Haskell. For a long time even getting a Haskell compiler to run was a massive pain.

So I started using Mark Jones' Gofer[1] interpreter which was trivial to build and still is 20 years later assuming you can find the source tar ball. It kept the nicer syntax of Miranda and added most of the power features of Haskell. I particularly liked the generalized list comprehension feature which really should have made it into Haskell; things like combinator parser code reads beautifully with it.

I know it's what you're used to but Haskell code always looks ugly to me in comparison to Miranda or Gofer.

[1] https://en.wikipedia.org/wiki/Gofer_(programming_language)