An introduction to the theory of schemata
Note: imported from RIT’s Digital Media Library running on DSpace to RIT Scholar Works. Physical copy available through RIT's The Wallace Library at: QA76.6.R484 1987
This paper is intended to be an expository introduction to the theory of program schemata. A program scheme may be thought of as the family of all real programs, that can be obtained by replacing the instruction symbols in a "program skeleton" by some set of appropriate actual instructions. Among the goals of the study of such objects are to provide a model of a computer program which is totally independent of the workings of any real or abstract machine, to provide a basis for the comparison of the "expressive power" of programming languages, and to provide "normal forms" to assist in program decidability results, the canonical forms of block-structured and WHILE schemes, and a comparison of schemes augmented with recursion, pushdown stores, array, and label.