What I learned from my first serious attempt low-level Haskell programming

[Simon Marlow]

Lennart Augustsson wrote:
> It's not that hard to figure out an order to permute the arguments on 
> the stack before a tail call that minimizes that number of moves and 
> temporary locations.  Lmlc did this 20 years ago. :)

Right, and that's what GHC does too, with a strongly-connected-component 
analysis of the dependencies between assignments of the args for the tail call.

Cheers,
	Simon