- Full text PDF available (170)
- This year (6)
- Last 5 years (36)
- Last 10 years (81)
Journals and Conferences
We introduce a calculus describing the movement of processes and devices, including movement through administrative domains. c © 2000 Elsevier Science B.V. All rights reserved.
types (CLU, etc.). (Impredicative existentials types.) Modules (Modula 2, etc.). (Predicative dependent types.) Objects and subtyping (Simula 67, etc.). (Subtyping + ???) • The first three innovations are now largely understood, in isolation, both theoretically and practically. Some of their combinations are also well understood. • There has been little… (More)
Our objective is to understand the notion of <I>type</I> in programming languages, present a model of typed, polymorphic programming languages that reflects recent research in type theory, and examine the relevance of recent research to the design of practical programming languages. Object-oriented languages provide both a framework and a motivation for… (More)
Obliq is a lexically-scoped, untyped, interpreted language that supports distributed object-oriented computation. Obliq objects have state and are local to a site. Obliq computations can roam over the network, while maintaining network connections. Distributed lexical scoping is the key mechanism for managing distributed computation.
We investigate the interactions of subtyping and recursive types, in a simply typed λ-calculus. The two fundamental questions here are whether two (recursive)types are in the subtype relation and whether a term has a type. To address the first question, we relate various definitions of type equivalence and subtyping that are induced by a model, an… (More)
Statically-typed programming languages allow earlier error checking, better enforcement of disciplined programming styles, and generation of more efficient object code than languages where all type-consistency checks are performed at runtime. However, even in statically-type languages, there is often the need to deal with data whose type cannot be known at… (More)
The λ&sgr;-calculus is a refinement of the λ-calculus where substitutions are manipulated explicitly. The λ&sgr;-calculus provides a setting for studying the theory of substitutions, with pleasant mathematical properties. It is also a useful bridge between the classical λ-calculus and concrete implementations.
Biomolecular systems, composed of networks of proteins, underlie the major functions of living cells. Compartments are key to the organization of such systems. We have previously developed an abstraction for biomolecular systems using the πcalculus process algebra, which successfully handled their molecular and biochemical aspects, but provided only a… (More)
The Ambient Calculus is a process calculus where processes may reside within a hierarchy of locations and modify it. The purpose of the calculus is to study mobility, which is seen as the change of spatial configurations over time. In order to describe properties of mobile computations we devise a modal logic that can talk about space as well as time, and… (More)