Until now, only users of textual programming languages have enjoyed the fruits of algorithm animation. Users of visual programming languages (VPLs) have been deprived of the unique semantic insights algorithm animation offers, insights that would foster the understanding and debugging of visual programs. To begin solving this shortcoming, we have seamlessly integrated algorithm animation capabilities into Forms/3, a declarative VPL in which evaluation is the continuous maintenance of a network of one-way constraints. Our results show that a VPL that uses this constraint-based evaluation model can provide features not found in other algorithm animation systems. 1: Introduction Algorithm animation is a type of software visualization of growing importance. It is a dynamic visualization of the main abstractions of a program's underlying algorithm. The value of algorithm animation lies in its ability to portray the essence of the program's logic, avoiding the obscuring of this essence tha...

Until now, only users of textual programming languages have enjoyed the fruits of algorithm animation. Users of visual programming languages (VPLs) have been deprived of the unique semantic insights algorithm animation offers. To begin solving this shortcoming, we have seamlessly integrated algorithm animation capabilities into the VPL Forms/3. Our research shows how a declarative VPL that is responsive can provide features not found in other algorithm animation systems. 1: Introduction This paper describes how we integrated a visual and declarative extension of an algorithm animation model called the path/transition paradigm [1] into Forms/3 [2], a declarative VPL. Our goal was not a system for animating algorithms implemented in other languages. Rather, our goal was to use a VPL to animate algorithms that are themselves programmed in that VPL. At first we simply wanted to see if a declarative VPL could support algorithm animation without compromising the fundamental characteristics...