We provide a strong normalization result for MLF , a type system generalizing ML with first-class polymorphism as in system F. The proof is achieved by translating MLF into a calc...
We design and study νObj, a calculus and dependent type system for objects and classes which can have types as members. Type can be aliases, abstract types, or new types. The type...
The -calculus o ers an attractive basis for concurrent programming. It is small, elegant, and well studied, and supports via simple encodings a wide range of high-level constru...
Abstract. PiLib is a library written in Scala that implements the concurrency constructs of the π-calculus. Some features of the programming language Scala, examined in the paper,...
The SLam calculus is a typed -calculus that maintains security information as well as type information. The type system propagates security information for each object in four for...