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 …

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 ML. The …

This paper shows how to systematically extend an arbitrary type system with dependency
information, and how soundness and non-interference proofs for the new system may rely …

This paper introduces a language feature, called implicit parameters, that provides
dynamically scoped variables within a statically-typed Hindley-Milner framework. Implicit …

We present a translation scheme for the polymorphically typed call-by-value λ-calculus. All
runtime values, including function closures, are put into regions. The store consists of a stack …

We observe that the principal typing property of a type system is the enabling technology for
modularity and separate compilation [10]. We use this technology to formulate a modular …

Automatic binding time analysis for a typed X-calculus Page 1 Automatic binding time
analysis for a typed X-calculus (Extended Abstract) Hanne R. Nielson Institute of Electronic …

The benefits of strong typing to disciplined programming, to compile-time error detection and
to program verification are well known. Strong typing is especially natural for functional …

The motivation of this work is to provide a type-theoretical basis for developing a practical
polymorphic programming language with labeled records and labeled variants. Our goal is …

It has been nearly twenty years since Robin Milner introduced ML as the metalanguage of
the LCF interactive theorem prover [5]. His elegant use of abstract types to ensure validity of …