The design of a module system for constructing and maintaining large programs is a difficult
task that raises a number of theoretical and practical issues. A fundamental issue is the …

This paper presents a variant of the SML module system that introduces a strict distinction
between abstract types and manifest types (types whose definitions are part of the module …

Module mechanisms have received considerable theoretical attention, but the associated
concepts of separate compilation and linking have not been emphasized. Anomalous …

We demonstrate the pragmatic value of the principal ty** property, a property distinct from
ML's principal type property, by studying a type system with principal ty**s. The type …

Fast analysis response times in IDEs are essential for a good editor experience. Incremental
type-checking can provide that in a scalable fashion. However, existing techniques are not …

A soft type system infers types for the procedures and data structures of dynamically typed
programs. Like conventional static types, soft types express program invariants and thereby …

This article presents a program analysis to estimate uncaught exceptions in ML programs.
This analysis relies on unification-based type inference in a nonstandard type system, using …

Previous methods have generally identified the location of a type error as a particular
program point or the program subtree rooted at that point. We present a new approach that …

We present a higher-order module system for the purely functional data-parallel array
language Futhark. The module language has the property that it is completely eliminated at …

Soft ty** is a generalization of static type checking that accommodates both dynamic
ty** and static ty** in one framework. A soft type checker infers types for identifiers and …