Trampoline
Reifies continutations onto the heap, rather than the stack. Allows efficient tail calls.
Example usage:
{ { ifi == n return ; return ; } return ;}
Where loop
is the identity function for positive numbers. Without
trampolining, this function would take n
stack frames.