Statistical learning theory was introduced in the late 1960’s. Until the 1990’s it was a purely theoretical analysis of the problem of function estimation from a given collection of data. In the middle of the 1990’s new types of learning algorithms (called support vector machines) based

We present a system for extending standard type systems with flow-sensitive type qualifiers. Users annotate their programs with type qualifiers, and inference checks that the annotations are correct. In our system only the type qualifiers are modeled flow-sensitively - the underlying standard types

The aim of this work is largely a practical one. A widely employed style of programming, particularly in structure-processing languages which impose no discipline of types, entails defining procedures which work well on objects of a wide variety. We present a formal type discipline

Least fixpoints as meanings of recursive definitions.

Abstract not found

-Simons gauge theory can arise as a string theory. The world-sheet model in this case involves a topological sigma model. Instanton contributions to the sigma model give rise to Wilson line insertions in the space-time Chern-Simons theory. A certain holomorphic analog of Chern-Simons theory can also arise as a

to model object-oriented features. Recently, in joint work with Martin Abadi, I have studied more direct models of object-oriented features: object calculi. Object calculi embody, in a minimal setting, the object-oriented model of computation, as opposed to the imperative, functional, and process models

A theory of memory retrieval is developed and is shown to apply over a range of experimental paradigms. Access to memory traces is viewed in terms of a resonance metaphor. The probe item evokes the search set on the basis of probe-memory item relatedness, just as a ringing tuning fork evokes

We demonstrate that a simple model, constructed on the premise that people are motivated by both their pecuniary payoff and their relative payoff standing, explains behavior in a wide variety of laboratory games. Included are games where equity is thought to be a factor, such as ultimatum, two

and logic, and much progress has been made in developing verification algorithms, heuristics, and tools. This paper provides a survey of the theory of timed automata, and their role in specification and verification of real-time systems.