Add to ORKGAbstract. This paper presents a compositional denotational semantics for goto jumps. The semantics interacts well with the idioms of structural programming, like ifstatements and while-loops. It faithfully models jumps into and out of nested blocks and it can also handle computed jumps (in the form of C’s switch-statement). The underlying mathematics is remarkable simple: It only uses total functions of ordinary set theory and disjoint unions. Neither domain theory nor continuous functions are required. The paper demonstrates the semantics for a simple while language containing assignments, goto jumps and switch-statements. The semantics is used to verify Duff’s device, a famous example of the (ab-)use of computed jumps in structural progra...