Structured Programming With and Without go to Statements

DOI10.1109/TSE.1976.233800MaRDI QIDQ4118796zbMATH OpenOpenAlexFDO

Authors Calvin C. Elgot

Publication date 1976

Published in IEEE Transactions on Software Engineering (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tse.1976.233800

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cited in

(16)

• Fundamental properties of infinite trees
• Continuation semantics for flowgraph equations
• In memoriam Calvin C. Elgot
• Regular trees and the free iterative theory
• A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization
• The equational logic of fixed points
• Axiomatizing schemes and their behaviors
• Equational logic of circular data type specification
• Condition/decision duality and the internal logic of extensive restriction categories
• A generalized mathematical theory of structured programming
• THE POWER OF THE GROUP-IDENTITIES FOR ITERATION
• Rewriting on cyclic structures: Equivalence between the operational and the categorical description
• Calvin C. Elgot (1922-1980)
• Algebraic characterization of reducible flowcharts
• Deterministic and nondeterministic flowchart interpretations
• An axiomatization of D-scheme strong equivalence

This page was built for publication: Structured Programming With and Without go to Statements

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