This paper discusses the translation of temporal expressions, in the framework of the machine translation system Rosette. The translation method of Rosette, the 'isomorphic grammar method', is based on Montague's Composittonality Principle. It is shown that a compositional approach

Motivated by the problem of automatically composing network accessible services, such as those on the World Wide Web, this paper proposes an approach to building agent technology based on the notion of generic procedures and customizing user constraint. We argue that an augmented version

of proposals such as rely/guarantee conditions but the overall search for a satisfactory compositional approach to concurrency is an open problem. This paper identifies some issues including granularity and the problems associated with ghost variables; it also discusses using atomicity as a design abstraction

prerequisite for exploiting the modular structure of Statecharts for simulation, verification, and code generation, and it also provides the necessary foundation for reusability. This paper suggests a new compositional approach to formalizing Statecharts semantics as flattened transition systems in which

We present a perturbative approach to QCD based on quark composites, that is barions and mesons, as fundamental variables. 1 We present an approach to QCD where quark composites with hadronic quantum numbers are assumed as integration variables in the Berezin integral which defines the partition

π0 → γγ decay and the chiral anomaly in

Abstract. We propose a compositional approach to the dynamics of gene regulatory networks based on the stochastic π-calculus, and develop a representation of gene network elements which can be used to build complex circuits in a transparent and efficient way. To demonstrate the power

at great cost. In this paper we describe a partial solution to this problem, whereby interaction mechanisms are constructed compositionally. Specifically, we describe a set of operators that can transform generic communication mechanisms (such as RPC and publish-subscribe) to incrementally add new

is a prerequisite for exploiting the modular structure of Statecharts for simulation, verification, and code generation, and it also provides the necessary foundation for reusability. This paper suggests a new compositional approach to formalizing Statecharts semantics as flattened transition systems

This paper presents a model of concurrent object-oriented programming in which specification of computational behavior is separated from specification of interaction behavior of methods. It will be shown that this compositional approach to concurrent programming avoids someof the conceptual