Decidable Properties of Monadic Functional Schemas
Journal of the ACM (JACM)
Flowchart schemata with counters
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Efficient compilation of linear recursive programs.
Efficient compilation of linear recursive programs.
On the power of programming features.
On the power of programming features.
Program schemata and information flow: a study of some aspects of the schema-power of data structures.
On the properties and applications of program schemas
On the properties and applications of program schemas
An analysis of parameter evaluation for recursive-procedures.
An analysis of parameter evaluation for recursive-procedures.
Initial Algebra Semantics and Continuous Algebras
Journal of the ACM (JACM)
Communications of the ACM
On the complexity of grammar and related problems
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
ACM SIGACT News
| Hi-index | 0.02 |
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.