Applicability checking in visual programming languages

The notion of applicability checking attempts to determine the limits of applicability of a general programming language expression and to automatically make necessary adjustments to accommodate various irregularities, including boundary conditions. This paper presents an approach to applicability checking. A set of rules are supplied for determining applicability, developing applicable regions, and coercing structures automatically. Examples are presented to demonstrate the application of these rules