Continuation semantics for flowgraph equations

DOI10.1016/0304-3975(86)90125-8MaRDI QIDQ1080651zbMATH OpenOpenAlexFDO

Authors William F. Dowling, Jean Gallier

Publication date 1986

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0304-3975(86)90125-8

zbMATH Keywords

composition operatorsiterationpairingrecursive systems of flowgraph equations

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60)

Review text

We 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.

Recommendations

• scientific article; zbMATH DE number 1049043
• On the transformation between direct and continuation semantics
• Algebraic semantics of recursive flowchart schemes
• Continuations in possible-world semantics
• scientific article; zbMATH DE number 1722643

Cites work

• A semantically meaningful characterization of reducible flowchart schemes
• Algebraic and graph theoretic characterizations of structured flowchart schemes
• Control Flow Aspects of Semantics-Directed Compiling
• Deriving Target Code as a Representation of Continuation Semantics
• Erratum and Corrigendum for "Structured Programming With and Without GO TO Statements"
• scientific article; zbMATH DE number 3512082 (Why is no real title available?)
• scientific article; zbMATH DE number 3557184 (Why is no real title available?)
• scientific article; zbMATH DE number 3640837 (Why is no real title available?)
• Initial Algebra Semantics and Continuous Algebras
• More on advice on structuring compilers and proving them correct
• Proving algorithms by tail functions
• Structured Programming With and Without go to Statements
• Theory of program structures: Schemes, semantics, verification

Cited in

(1)

• scientific article; zbMATH DE number 2158986 (Why is no real title available?)

This page was built for publication: Continuation semantics for flowgraph equations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1080651)