We present a uniqueness type system that is simpler than both Clean's uniqueness system
and a system we proposed previously. The new type system is straightforward to implement …

We present a linear functional calculus with both the safety guarantees expressible with
linear types and the rich language of combinators and composition provided by functional …

Since the mid'80s, compiler writers for functional languages (especially lazy ones) have
been writing papers about identifying and exploiting thunks and lambdas that are used only …

In order to solve a long-standing problem with list fusion, a new compiler transformation,"
Call Arity" is developed and implemented in the Haskell compiler GHC. It is formally proven …

Adapting a strictness analyser to have it take into account explicit strictness annotations can
be a tricky business. Straightforward extensions of analyses based on relevance typing are …

Since the mid'80s, compiler writers for functional languages (especially lazy ones) have
been writing papers about identifying and exploiting thunks and lambdas that are used only …

We combine the type error slicing and heuristics based approaches to type error diagnostic
improvement within the context of type based security analysis on a let-polymorphic call by …

We modify Clean's uniqueness type system in two ways. First, while Clean functions that are
partially applied to a unique argument are necessarily unique (they cannot lose their …

We view channels as the main form of resources in a message-passing programming
paradigm. These channels need to be carefully managed in settings where resources are …

In this brief announcement we outline work we have done on defining a polyvariant
cardinality analysis for a non-strict higher-order language equipped with user defined …