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 properties and applications of program schemas
On the properties and applications of program schemas
Formal languages and their relation to automata
Formal languages and their relation to automata
Synchronous schemes and their decision problems
POPL '80 Proceedings of the 7th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Flowchart schemata with counters
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
Equivalence of linear, free, liberal, structured program schemas is decidable in polynomial time
Theoretical Computer Science
Effective proper procedures and universal classes of program schemata
Journal of Computer and System Sciences
Translatability of schemas over restricted interpretations
Journal of Computer and System Sciences
On the power of programming features
Computer Languages
| Hi-index | 0.00 |
We discuss the class of program schemas augmented with equality tests, that is, tests of equality between terms. In the first part of the paper we discuss and illustrate the “power” of equality tests. It turns out that the class of program schemas with equality is more powerful than the “maximal” classes of schemas suggested by other investigators. In the second part of the paper we discuss the decision problems of program schemas with equality. It is shown for example that while the decision problems normally considered for schemas (such as halting, divergence, equivalence, isomorphism and freedom) are solvable for Ianov schemas, they all become unsolvable if general equality tests are added. We suggest, however, limited equality tests which can be added to certain subclasses of program schemas while preserving their solvable properties.