ISBN:  Unavailable

Category: Unavailable

Page count: 462

The interesting questions one can ask about program schemas include questions about the power of classes of shemas and their decision problems viz. halting, divergence, equivalence, etc. Considered first are the powers of schemas with various features: recursion, equality tests, and several data structures such as pushdown stacks, lists, queues and arrays. Then the decision problems for schemas with equality and with commutative and invertible functions are considered. Finally a generalized class of schemas is described in an attempt to unify the various classes of uninterpreted and semi-interpreted schemas and schemas with special data structures. (Author).