Program schemas with equality
Ashok K. Chandra, Zohar Manna · ACM Symposium on Theory of Computing (STOC) · 1972
We discuss the class of program schemas augmented with equality tests, that is, tests of equality between terms.
Cited by 16 works. doi:10.1145/800152.804896 Open-access PDF
Authors
References
- Formal Languages and Their Relation to Automata
- Formal Languages and their Relation to Automata
- On formalised computer programs
- On Ianov's Program Schemata
- Equivalence Problems in a Model of Computation
- Comparative schematology
- Translating recursion equations into flow charts
- Program schemes, recursion schemes, and formal languages
- Efficient compilation of linear recursive programs
- Decidable Properties of Monadic Functional Schemas