#### Filter Results:

#### Publication Year

1985

2017

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

We present a simple extension of typed λ-claculus where functions can be <italic>overloaded</italic> by adding different “pieces of code”. In short, the code of an overloaded function is formed by several branches of code; the branch to execute is chosen, when the function is applied, according to a particular selection rule which depends… (More)

The ambient logic is a modal logic proposed to describe the structural and computational properties of distributed and mobile computation. The structural part of the ambient logic is, essentially, a logic of labeled trees, hence it turns out to be a good foundation for query languages for semistructured data, much in the same way as first order logic is a… (More)

Fibonacci is a strongly typed, object-oricntcd database programming language with a new mechanism to model objects with roles. Traditional object-oriented programming languages do not have the possibility of changing dynamically the type of an object to model the bchaviour of real world entities which change their status over time. This is a severe… (More)

We add name groups and group creation to the typed ambient calculus. Group creation is surprisingly interesting: it has the eeect of statically preventing certain communications, and can thus block the accidental or malicious escape of capabilities that is a major concern in practical systems. Moreover, ambient groups allow us to reene our earlier work on… (More)

We investigate the complexity and expressive power of a spatial logic for reasoning about graphs. This logic was previously introduced by Cardelli, Gardner and Ghelli, and provides the simplest setting in which to explore such results for spatial logics. We study several forms of the logic: the logic with and without recursion, and with either an… (More)

The issue of this work is how to type mobility, in the sense that we tackle the problem of typing not only mobile agents but also their movement. This yields higher-order types for agents. To that end we first provide a new definition of the Seal Calculus that gets rid of existing inessential features while preserving the distinctive characteristics of the… (More)

The problem of defining and checking a subtype relation between recursive types was studied in [3] for a first order type system, but for second order systems, which combine subtyping and parametric polymorphism, only negative results are known [17]. This paper studies the problem of subtype checking for recursive types in system kernel Fun, a… (More)