Pharo takes a really interesting approach to recursion: instead of TCO, it just has an unbounded stack! '10000 factorial' just works.