Algebraic semantics of recursive flowchart schemes

DOI10.1016/S0019-9958(83)80032-1MaRDI QIDQ3334051zbMATH OpenOpenAlexFDO

Authors Hartmut Schmeck

Publication date 1983

Published in Information and Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0019-9958(83)80032-1

zbMATH Keywords

algebraic characterization of reducible flowchartsalgebraic fixed point semanticsalgebraic semanticsrecursive flowchart schemesrecursive schemerecursive tree schemes

Mathematics Subject Classification ID

Higher-type and set recursion theory (03D65) Theories (e.g., algebraic theories), structure, and semantics (18C10) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Algebraic characterization of reducible flowcharts
• scientific article; zbMATH DE number 4157896
• scientific article; zbMATH DE number 3956410
• Axiomatizing schemes and their behaviors
• scientific article; zbMATH DE number 4014009

Cited in

(11)

• Continuation semantics for flowgraph equations
• Algebraic solutions to recursion schemes
• Recursive tables and effective definition schemes
• A categorical foundation for structured reversible flowchart languages
• scientific article; zbMATH DE number 4014009 (Why is no real title available?)
• scientific article; zbMATH DE number 3858387 (Why is no real title available?)
• scientific article; zbMATH DE number 3870582 (Why is no real title available?)
• scientific article; zbMATH DE number 4201627 (Why is no real title available?)
• scientific article; zbMATH DE number 3928354 (Why is no real title available?)
• scientific article; zbMATH DE number 3956410 (Why is no real title available?)
• Algebraic characterization of reducible flowcharts

This page was built for publication: Algebraic semantics of recursive flowchart schemes

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