Program schemes, recursion schemes, and formal languages. (English) Zbl 0277.68010


68N01 General topics in the theory of software
68Q45 Formal languages and automata
Full Text: DOI


[1] deBakker, J.W.; Scott, Dana, A theory of programs, (August 1969), unpublished report
[2] Hopcroft, J.E.; Ullman, J.D., ()
[3] Ianov, Iu.I., The logical schemes of algorithms, Problemy kibernet., 1, 82-140, (1960)
[4] 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
[5] Nivat, M., Transductions des languages de chomsky, (), Chapter 6 · Zbl 0313.68065
[6] Paterson, M.S.; Hewitt, C.E., Comparative schematology, (), 119-128, published by the · Zbl 0401.68002
[7] Rabin, M.; Scott, D., Finite automata and their decision problems, IBM J. res. develop., 3, 114-125, (1959) · Zbl 0158.25404
[8] Shepherdson, J.C.; Sturgis, H.E., Computability of recursive functions, J. assoc. comput. Mach., 10, 217-255, (1963) · Zbl 0118.25401
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.