Logical Structure of State-Change Actions

This Chapter defines ABSTRACT MACHINES, built up from 3 elementary atomic state-change actions over structures: Parallel Guarded combinations of Assignments (PGAs) that update memory locations (function table entries) in structures of whatever desired level of abstraction. To illustrate domain-specific extensions of those fundamental constructs of computing a simple WORKSPACE INCREASE mechanism is added to PGAs.