A tail-recursive factorial in Coffeescript with simulated tail-call optimization.

factorial.coffee

bounce = (val) -> val = val() while typeof val == 'function'; val

factorial = (n) ->
  fact = (a, n) -> if n > 0 then -> fact a * n, n - 1 else a
  bounce fact 1, n

console.log factorial 10