Efficiency issues in a class of visual language

Abstract

A class of visual programming languages whose members share a common group of underlying principles is identified. In this class (the demand-driven temporal-assignment visual language model), the elimination of certain duplicate computations is a natural by-product of the model. The potential time and space complexity characteristics for visual languages based on this model are discussed, and a method that makes use of these characteristics is presented.<>