It's not like that first factorial function is actually any worse than the usual Haskell one: fac = \n -> product [1..n] The recursive one is also much th

It's not like that first factorial function is actually any worse than the usual Haskell one: fac = \n -> product [1..n] The recursive one is also much the same as a Haskell one, but Q is hardly built around idiomatic recursion.