Object-oriented application frameworks help software engineers develop sophisticated interactive applications quickly and reduce maintenance costs significantly.An application framework provides, among others, predefined visual classes for text or graphics display and for user interaction elements, as well as integrated control of these elements.Designed before motion video display was technically feasible on desktop computers, these frameworks' architectures are built around the assumption of relatively slowly changing bitmap images to be displayed on a computer screen.Motion video screen update rates were not anticipated.We extended a typical application framework in a multitasking environment to support motion video display in full generality.The internal architecture of the framework was changed to remove the subtle obstacles for high screen update rates and a data type 'video' was designed and integrated seamlessly with the existing visual classes.Our video objects display motion video generated by autonomous hardware or software processes.They may appear in any shape or number mixed with other visual objects in scrollable views, as building blocks in graphics editors, as characters in text editors, as items in list or pop-up menus, etc. Video objects support the full visual class protocol for client-transparent double buffering, cut/copy/paste/undo operations, and output to or input from files.In this paper, we describe the features of these video objects and our changes to the architecture of the application framework necessary to support the new paradigms of motion video.

Abstract Single‐assignment and functional languages have value semantics that do not permit side‐effects. This lack of side‐effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile‐time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update‐in‐place and build‐in‐place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run‐time overhead is imposed on the compiled programs.