Theoretical Computer Science

A sketch of the proof is given for an open problem, the range property forH: the range of a closed @l-term in the closed term model modulo @b-conversion and equating unsolvable terms is either a singleton or infinite. The proof depends on one unresolved ...

In this paper we revisit the @l-calculus with patterns, originating from the practice of functional programming language design. We treat this feature in a framework ranging from pure @l-calculus to orthogonal combinatory reduction systems.

We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value lambda-calculus can simulate each other within a polynomial time overhead. ...

The parametric lambda calculus subsumes different existing @l-calculi, in particular the classical @l@b-calculus and the @l@b"v-calculus of Plotkin. Previously established results on the parametric calculus, such as confluence and standardization, are ...

We introduce a new unification procedure for the type inference problem in the intersection type discipline. It is well known that type inference in this case should succeed exactly for the strongly normalizing expressions. We give a proof for the ...

This paper gives a new proof for the approximation theorem and the characterisation of normalisability using intersection types for a system with 'w and a @?-relation that is contra-variant over arrow types. The technique applied is to define reduction ...

Intersection types are well known to type theorists mainly for two reasons. Firstly, they type all and only the strongly normalizable lambda terms. Secondly, the intersection type operator is a meta-level operator, that is, there is no direct logical ...

We develop an intersection type system for the @l@?@m@m@? calculus of Curien and Herbelin. This calculus provides a symmetric computational interpretation of classical sequent style logic and gives a simple account of call-by-name and call-by-value. The ...

In this paper we introduce a new filter model, which is of a kind that has escaped investigation up to now: it is induced by an intersection type theory generated in a non-standard way, by a preorder which puts into relation an atom with an arrow type, ...

We present a type assignment system that provides a finitary interpretation of lambda terms in a game semantics model. Traditionally, type assignment systems describe the semantic interpretation of terms in domain-theoretic models. Quite surprisingly, ...

The partially ordered set of compact intervals provides a convenient embedding space for the analysis of some Dynamical Systems. Crucial dynamical properties are transferred to it, while allowing an investigation of stability and chaoticity, in terms of ...

Ambient Calculi represent a class of process calculi used to describe and model mobile and distributed computations. This paper examines the most relevant of these calculi and focuses on an important dimension: the access control problem. In the ...

Our society is increasingly moving towards richer forms of information exchange where mobility of processes and devices plays a prominent role. This tendency has prompted the academic community to study the security problems arising from such mobile ...

Subtyping relations for the @p-calculus are usually defined in a syntactic way, by means of structural rules. We propose a semantic characterisation of channel types and use it to derive a subtyping relation. The type system we consider includes read-...

In the context of Featherweight Java by Igarashi, Pierce, and Wadler, and its recent extension FeatherTrait Java (FTJ) by the authors, we investigate classes that can be extended with trait composition. A trait is a collection of methods, i.e., ...