Algebraic semantics of recursive flowchart schemes

Hartmut Schmeck
1983 Information and Control  
Based on the algebraic characterization of reducible graphical flowcharts, recursive flowchart schemes are introduced and studied. It is shown how to obtain interpretations of recursive flowchart schemes in the same mathematically elegant way as is well known in the case of recursive tree schemes. The results directly lead to algebraic fixed point semantics of recursive flowchart schemes.
doi:10.1016/s0019-9958(83)80032-1 fatcat:ye2sqm6th5eslnh47g66m5lowi