Alex Farkas

Learn More
One method of evaluating programs is for them to be prepared as self contained pieces of source, then compiled, linked and executed. The last phase may involve binding to and manipulating persistent values. When the persistent store is supported by a user interface, the program construction can be augmented by the use of tokens as denotations for persistent(More)
The traditional representation of a program is as a linear sequence of text. At some stage in the execution sequence the source text is checked for type correctness and its translated form is linked to values in the environment. When this is performed early in the execution process, confidence in the cor-rectness of the program is raised. During program(More)
Most existing file based operating systems tend to provide very little in the way of type related information about applications to the user. Instead, the user is required to construct applications that perform their own type checking, relying on information about existing programs and data to be obtained via other means, such as manual pages, or by visual(More)
During the lifetime of an application, the objects and bindings in a persistent store may require modification in order to fix bugs or incorporate changes. Two mechanisms, Octopus and Nodules, supporting the evolution of persistent applications are presented. The first, Octopus permits code and data values to be evolved, even if they are encapsulated. Type(More)
  • 1