This paper describes the transition axiom method I introduced in [50]. It was written for a NATO Advanced Study Institute that took place in Turkey in August, 1986, and contains little that was new.
“The Implementation of Functional Languages” is a book about implementing functional programming languages using lazy graph reduction, and it divides into three parts. The first part describes how to translate a high-level functional language into an intermediate language, called the lambda calculus, incuding detailed coverage…
The analysis of signals that can be represented as a linear combination of exponentially damped sinusoids where the values of damping factors, frequencies, and the linear combination coefficients change at certain transition times is considered. These transitions represent the opening and closing of the glottis…
Chuck Thacker posed a little synchronization problem to me, which I solved with Jim Saxe's help. At that time, deriving concurrent algorithms was the fashion--the idea that you discover the algorithm by some form of black magic and then verify it was considered passé. So,…
Resistive ballooning modes are unstable in the first region of ideal ballooning stability. We show that in contrast the second region is largely stable to resistive ballooning modes.
Polymorphic means to have many forms. As related to programming languages, it refers to data or programs which have many types, or which operate on many types. There are several arbitrary ways in which programs can have many types; we are mostly interested in a…
We demonstrate that classes of dependencies among beliefs held with uncertainty cannot be represented in rule-based systems in a natural or efficient manner. We trace these limitations to a fundamental difference between certain and uncertain reasoning. In particular, we show that beliefs held with certainty…
In a paper published in 1978 (Needham & Schroeder) we presented protocols for the use of encryption for authentication in large networks of computers. Subsequently the protocols were criticised (Denning and Sacco) on the grounds that compromise of a session key and copying of an…
Several areas of research on problem-solving tradeoffs in reasoning systems are presented. Issues surrouding the valuation of computation in the context of computational resource constraints are introduced. Areas of research on problem-solving tradeoffs receiving ongoing attention include: (1) strategic control, (2) structural control, and (3)…
Department of Mathematics, The University of Utah, Masters Thesis
In 1979, Blackley and Shamir independently proposed schemes by which a secret can be divided into many shares which can be distributed to mutually suspicious agents. This paper describes a homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets…
