So this is a bit more elm-y than it would otherwise be

Haskell, Keep it simple, stupid.

-- FizzBuzz
module Main where

import Control.Monad

main :: IO ()
main = forM_ [1..100] $ \n -> putStrLn . concat . take 2 $
    ["Fizz" | n `mod` 3 == 0] ++ 
    ["Buzz" | n `mod` 5 == 0] ++ 
    ["", show n]

Definición de tipos de datos en Haskell y comparación con Java, Python y JavaScript.

Alternativas en Haskell a las listas como contenedores.

This confused me. I'm relatively new to Haskell and did not know about sectioning. After learning that detail, this makes sense as a (right) partial application of the (==) function.

https://www.youtube.com/watch?v=06x8Wf2r2Mc

def. FRP library: Functional Reactive Programming Library

Saw this recommended on a Quora answer whilst looking for book and article recommendations for a newcomer to Haskell

Useful cheatsheat for Haskell operators

I'm not sure, but I think what he meant here was foldMap :: Monoid m => (a -> m) -> t a -> m.

There's more on Applicative (and Functor) here, in case you're unfamiliar with it.