Equivalence Problems for Monadic Schemas.
Interim scientific rept.,
MASSACHUSETTS INST OF TECH CAMBRIDGE PROJECT MAC
Pagination or Media Count:
A class of monadic program schemas is defined. This class, called iteration schemas, consists of schemas whose programs comprise assignment statements, conditional statements, and iteration statements. A notion of equivalence is formalized as the functional equivalence of schemas under free interpretations, interpretations which represent symbolically the set of all interpretations of a schema. It is shown that the equivalence problem for iteration schemas is unsolvable, even if the schemas possess highly restrictive properties.
- Computer Programming and Software