Reverse Polish Notation Calculator
Using foldl is the right idea, I think.  (\acc x -&gt; foldingFunction acc x) is a useless lambda, which could just be written as foldingFunction.  The fact that it's a folding function is evident from the fact that you passed it to foldl; you could name it something more useful, such as manipulateStack.

Consider breaking up solveRPN.  For example, it might be useful to inspect the end state of the whole stack rather than just taking the top element.  Also, it's possible that the input might already be split into words (from the command line via getArgs, for example).

The beauty and simplicity of RPN comes from the fact that operators can manipulate the stack directly.  Instead, you've implemented a calculate function that performs binary operations only.  That results in two problems:


In the case of RPN stack underflow, you'll get a "Non-exhaustive patterns in function calculate" error.
You can't support unary operators (such as "sqrt"), nor can you support nullary operators (such as a "pi" operator that pushes 3.141592653589793 onto the stack).




import System.Environment

manipulateStack :: [Double] -&gt; String -&gt; [Double]
manipulateStack stack s
  | s == "+"     = (next + top) : stack''
  | s == "-"     = (next - top) : stack''
  | s == "*"     = (next * top) : stack''
  | s == "/"     = (next / top) : stack''
  | s == "^"     = (next ** top) : stack''
  | s == "sqrt"  = (sqrt top) : stack'
  | s == "sin"   = (sin top) : stack'
  | s == "cos"   = (cos top) : stack'
  | s == "tan"   = (tan top) : stack'
  | s == "pi"    = pi : stack
  | s == "e"     = (exp 1) : stack
  | otherwise    = (read s::Double):stack
  where top = head stack
        stack' = tail stack
        next = head stack'
        stack'' = tail stack'

rpn :: ([Double] -&gt; [String] -&gt; [Double])
rpn = foldl manipulateStack

solveRPN :: String -&gt; Double
solveRPN s = head $ rpn [] $ words s

main = do
  args &lt;- getArgs
  putStrLn $ show $ head $ rpn [] args