Structured Programming With and Without go to Statements

DOI10.1109/TSE.1976.233800zbMath0348.68008OpenAlexW2123694805MaRDI QIDQ4118796

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)

Related Items (16)

Continuation semantics for flowgraph equations ⋮ THE POWER OF THE GROUP-IDENTITIES FOR ITERATION ⋮ Condition/decision duality and the internal logic of extensive restriction categories ⋮ The equational logic of fixed points ⋮ 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 ⋮ A generalized mathematical theory of structured programming ⋮ Rewriting on cyclic structures: Equivalence between the operational and the categorical description ⋮ Axiomatizing schemes and their behaviors ⋮ Equational logic of circular data type specification ⋮ Calvin C. Elgot (1922-1980) ⋮ Algebraic characterization of reducible flowcharts ⋮ Fundamental properties of infinite trees ⋮ 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