论文信息 - Degrees of translatability and canonical forms in program schemas: Part I

Degrees of translatability and canonical forms in program schemas: Part I

We define a measure of the generality of the control structure of a program schema. This imposes a partial ordering on program schemas, and leads to a concept of the “difficulty” of a programming problem. In this sense there exists a “hardest” flowchart program, recursive program etc. Some earlier proofs can also be simplified and/or clarified by this approach.

Ashok K. Chandra | A. K. Chandra

[1] Stephen J. Garland,et al. Program Schemes, Recursion Schemes, and Formal Languages , 1973, J. Comput. Syst. Sci..

[2] Lawrence Snyder. An analysis of parameter evaluation for recursive-procedures. , 1973 .

[3] David C. Luckham,et al. On Formalised Computer Programs , 1970, J. Comput. Syst. Sci..

[4] Michael Stewart Paterson,et al. Equivalence Problems in a Model of Computation , 1967 .

[5] David Gries,et al. Program Schemes with Pushdown Stores , 1972, SIAM J. Comput..

[6] Zohar Manna,et al. Decidable Properties of Monadic Functional Schemas , 1973, JACM.

[7] Zohar Manna,et al. On the Power of Programming Features , 1976, Comput. Lang..

[8] Carl Hewitt,et al. Comparative Schematology , 1970 .

[9] H. Raymond Strong,et al. Characterizations of Flowchartable Recursions , 1973, J. Comput. Syst. Sci..

[10] John Steven Brown. Program schemata and information flow: a study of some aspects of the schema-power of data structures. , 1972 .

[11] Ashok Kumar Chandra. On the properties and applications of program schemas , 1973 .

[12] David A. Plaisted. Flowchart schemata with counters , 1972, STOC '72.

[13] Ashok K. Chandra. Efficient Compilation of Linear Recursive Programs , 1973, SWAT.

[14] Robert L. Constable,et al. On Classes of Program Schemata , 1971, SWAT.

[15] Carl E. Hewitt,et al. More Comparative Schematology , 1970 .