DocumentCode
2782030
Title
Efficiency issues in a class of visual language
Author
Burnett, Margaret M. ; Ambler, Allen L.
Author_Institution
Dept. of Comput. Sci., Kansas Univ., Lawrence, KS, USA
fYear
1990
fDate
4-6 Oct 1990
Firstpage
209
Lastpage
214
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
Keywords
computational complexity; functional programming; high level languages; programming theory; visual programming; demand-driven temporal-assignment; duplicate computations elimination; efficiency; space complexity; time complexity; visual programming languages; Computational modeling; Computer displays; Computer languages; Computer science; Parallel processing;
fLanguage
English
Publisher
ieee
Conference_Titel
Visual Languages, 1990., Proceedings of the 1990 IEEE Workshop on
Conference_Location
Skokie, IL
Print_ISBN
0-8186-2090-0
Type
conf
DOI
10.1109/WVL.1990.128408
Filename
128408
Link To Document