We describe a type system for checking interference using the concept of linear capabilities
(which we call “permissions”). Our innovations include the concept of “fractional” …

We motivate the design of typed assembly language (TAL) and present a type-preserving
ttranslation from Systemn F to TAL. The typed assembly language we pressent is based on a …

The mismatch between the operational semantics of the lambda calculus and the actual
behavior of implementations is a major obstacle for compiler writers. They cannot explain …

This paper presents a type-based information flow analysis for a call-by-value λ-calculus
equipped with references, exceptions and let-polymorphism, which we refer to as Core ML …

We are investigating a new approach to compiling Standard ML (SML) based on four key
technologies: interwional polymorphism [23], nearlg tag-free garbage collection[12, 46, 34] …

We review the existing literature on Java safety, emphasizing formal approaches, and the
impact of Java safety on small footprint devices such as smartcards. The conclusion is that …

Traditional techniques for implementing polymorphism use a universal representation for
objects of unknown type. Often, this forces a compiler to use universal representations even …

An increasing number of systems rely on programming language technology to ensure
safety and security of low-level code. Unfortunately, these systems typically rely on a …

Closure conversion is a program transformation used by compilers to separate code from
data. Previous accounts of closure conversion use only untyped target languages. Recent …

In this paper we prove time and space bounds for the implementation of the programming
language NESL on various parallel machine models. NESL is a sugared typed λ-calculus …