Continuation semantics for flowgraph equations

AbstractWe give the syntax and semantics of a language for expressing recursive systems of flowgraph equations. The flowgraphs may have “GOTO” nodes, i.e., nodes which represent edges external to the flowgraph, but which may become internal if the flowgraph is composed with other flowgraphs. This requires the use of continuation semantics. We give an elementary proof that the language we use to express flowgraphs, containing iteration, pairing, and composition operators, is sufficient to do so. Continuation semantics is then defined via this language