Wide distribution of the computer algebra system Mathematica1 has encouraged numerous programmers, researchers and educators to produce libraries of programs in its special language, for incorporation as \packages " into Mathematica systems. Although some features of the language are quite

This paper will describe my experiences in moving on from Lisp-Stat to Java to R. I was introduced to Lisp-Stat in 1989 and used it actively for teaching and research over the next 10 years. My use of Lisp-Stat culminated in a joint project with Hani Doss and I on Bayesian Sensitivity Analysis

Software transactional memory (STM) is a promising approach for coordinating concurrent threads, for which many implementation strategies are currently being researched. Although some first steps exist to ease experimenting with different strategies, this still re-mains a relatively complex

This article reports the results of an ongoing experimental research on the behavior and performance of CLOS, the COMMON-LISP Object System. Our purpose is to evaluate the behavior and performance of the 3 most important characteristics of any dynamic object-oriented system: class instantiation

. The initial design was driven by language features present in C, but not in Ada, or vice-versa. In time our needs and aspirations grew and Q evolved to support other languages, such as C++, Lisp, and Prolog. As a result of pervasive usage by the Arcadia SDE research project, usage levels and modes of the Q

During the last few years, the network research community and the industry have been working on the design of an alternate Internet Routing Archi-tecture aiming at solving the issues arising in the current architecture. It is widely accepted that applying a Locator/ID Separation paradigm would

on the CPU time the problem solver is allowed to spend on any individual problem. Segre et al. [1991] argue that the experimenter's choice of time bound can bias the results of the experiment. To address this problem, we present statistical hypothesis tests specifically designed to analyze speedup data

The future annotations of MultiLisp provide a simple method for taming the implicit parallelism of functional programs. Past research concerning futures has focused on implementation issues. In this paper, we present a series of operational semantics for an idealized functional language

Package), allows the researcher to define and run experiments, including experimental conditions (parameter values of the planner or simulator) and data to be collected. The data are written out to data files that can be analyzed by statistics software. The second tool, called Clasp (Common Lisp

not have been found through testing. This effort required a substantial manual modeling effort involving both abstraction and translation from the prototype LISP code to the PROMELA language used by SPIN. This experience and others led to research to address the gap between formal method tools