Applicability checking in visual programming languages

17 December 2002

conference paper
Published by Institute of Electrical and Electronics Engineers (IEEE)

p. 31-38
https://doi.org/10.1109/vl.1994.363643

Abstract

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.<>

Keywords

COMPUTER LANGUAGES
EQUATIONS
BOUNDARY CONDITIONS
FUNCTIONAL PROGRAMMING
JOINING PROCESSES

This publication has 2 references indexed in Scilit:

Visual representation and manipulation of matrices
Journal of Visual Languages & Computing, 1992
Revised Report on the Algorithmic Language Algol 68
Published by Springer Nature ,1976