Equivalence Problems for Monadic Schemas
| dc.contributor.advisor | Dennis, Jack B. | en_US |
| dc.contributor.author | Qualitz, Joseph E. | en_US |
| dc.date.accessioned | 2023-03-29T14:59:27Z | |
| dc.date.available | 2023-03-29T14:59:27Z | |
| dc.date.issued | 1975-06 | |
| dc.identifier.uri | https://hdl.handle.net/1721.1/149446 | |
| dc.description.abstract | 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. These schemas are shown to correspond to program schemas which are structured, and are shown to be strictly less "powerful" than monadic program schemas. | en_US |
| dc.relation.ispartofseries | MIT-LCS-TR-152 | |
| dc.relation.ispartofseries | MAC-TR-152 | |
| dc.title | Equivalence Problems for Monadic Schemas | en_US |
| dc.identifier.oclc | 02127867 |
