Issue No. 03 - March (1995 vol. 28)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2.366157
Visual programming languages (VPLs) appear to have great promise towards lessening the distinction between programming and problem solving, by making programming more direct, more immediate, and simpler. However, making VPLs suitable for solving large, realistic programming problems often seems to require reintroducing the very complexities that VPLs seek to avoid. This is called the scaling-up problem. This paper discusses the opportunities and obstacles VPLs encounter when attempting to solve the scaling-up problem. An understanding of this problem, its components, and the interrelationships among these components is necessary to ensure that efforts to solve the problem are productive and that these efforts do not compromise the qualities that make VPLs attractive.
S. Yang, C. Bohus, M. M. Burnett, M. J. Baker, P. Carlson and P. van Zee, "Scaling Up Visual Programming Languages," in Computer, vol. 28, no. , pp. 45-54, 1995.