Verification and Semantic Checking of APL Programs

摘要: Apl is of interest in regard to program verification for two reasons: (1) Many loops may be replaced by the structured operators, resulting easier programs with arrays. (2) The partial operators introduce complication showing executability. latter reason leads a new form programming, called “semantic checking.”