We demonstrate that the run time of implicitly parallel programs can be statically predicted with considerable accuracy when expressed within the constraints of a skeletal, shapel...
Abstract. We present a general methodology for non-deterministic programming based on pure functional programming. We construct families of automata constructions which are used as...
: An ellipsis resolution mechanism is presented. The mechanism is a part of a Natural Language Understanding System developed in the last years in order to be included as a main co...
Most of the research, to date, on optimizing program transformations for declarative languages has focused on sequential execution strategies. In this paper, we consider a class o...
This paper describes our experience in developing a software system for use in the environmental modeling community. The primary user of this software is intended to be a scientis...