Continuation semantics for flowgraph equations

DOI10.1016/0304-3975(86)90125-8zbMath0599.68020OpenAlexW2005795984MaRDI QIDQ1080651

Jean H. Gallier, William F. Dowling

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

iterationcomposition operatorspairingrecursive systems of flowgraph equations

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• More on advice on structuring compilers and proving them correct
• Theory of program structures: Schemes, semantics, verification
• 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
• Structured Programming With and Without go to Statements
• Erratum and Corrigendum for "Structured Programming With and Without GO TO Statements"
• Initial Algebra Semantics and Continuous Algebras
• Proving algorithms by tail functions

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