[Haskell-cafe] why is Prelude.^ so convoluted?

Brandon Beck bmbeck at gmail.com
Thu Jul 29 12:19:50 EDT 2004

I'm far from an expert in Haskell, but I suspect the justification is
because the version in the prelude is tail recursive while yours
isn't.  So the tail recursive version should run a bit faster when n
is large.

More information about the Haskell-Cafe mailing list