[CodeArtisan]

>The only language where unconditional jumps make sense is Assembly.

In Scheme, because a lambda expression is a closure and shall be optimized with tail call elimination, it is considered as the ultimate goto. It's goto but with procedural abstraction.

[pjmlp]

Yes, which means you are sure where the flow goes next, instead of hunting down goto spaghetti.

Even call/cc is more structured than plain gotos.

[CodeArtisan]

I am not sure about that. What about high order programming

    (define (goto proc) 
      (proc))

[pjmlp]

It still has a call stack, goto only goes forward.