zbMATH — the first resource for mathematics

Characterization of flowchartable recursions. (English) Zbl 0266.68011

68N01 General topics in the theory of software
68Q25 Analysis of algorithms and problem complexity
Full Text: DOI
[1] DeBakker, J.W.; Scott, D., A theory of programs, (August, 1969), unpublished (as described in [2]
[2] Garland, S.J.; Luckham, D.C., Program schemes, recursion schemes, and formal languages, Technical report UCLA-ENG-7154, (June, 1971)
[3] Luckham, D.C.; Park, D.M.R.; Paterson, M.S., On formalized computer programs, J. comput. system sci., 4, 220-249, (1970) · Zbl 0209.18704
[4] Paterson, M.S., Equivalence problems in a model of computation, () · Zbl 0186.01103
[5] Paterson, M.S.; Hewitt, C.E., Comparative schematology, (), 119-128 · Zbl 0401.68002
[6] Plaisted, D.A., Flowchart schemes with counters, () · Zbl 0358.68020
[7] Strong, H.R., Translating recursion equations into flow charts, J. comput. system sci., 5, 254-285, (1971) · Zbl 0239.68002
[8] Strong, H.R.; Walker, S.A., Properties preserved under recursion removal, IBM research report RC-3633, November, (1971)
[9] Walker, S.A., Some graph games related to the efficient calculation of expressions, IBM research report RC-3628, November, (1971)
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.