We present a verified compiler to an idealized assembly language from a small, untyped
functional language with mutable references and exceptions. The compiler is programmed …

Gradual type systems offer a smooth continuum between static and dynamic typing by
permitting the free mixture of typed and untyped code. The runtime systems for these …

We present an internal language with equivalent expressive power to Standard ML, and
discuss its formalization in LF and the machine-checked verification of its type safety in …

The IEEE/ANSI standard for Scheme requires implementations to be properly tail recursive.
This ensures that portable code can rely upon the space efficiency of continuation-passing …

Certified code is a general mechanism for enforcing security properties. In this paradigm,
untrusted mobile code carries annotations that allow a host to verify its trustworthiness …

In this functional pearl, we examine the use of definitional interpreters as a basis for abstract
interpretation of higher-order programming languages. As it turns out, definitional …

We present a Separation Logic with space credits for reasoning about heap space in a
sequential call-by-value lambda-calculus equipped with garbage collection and mutable …

It is an important criterion of program correctness that a program accesses resources in a
valid manner. For example, a memory region that has been allocated should be eventually …

This paper define the semantics of MinAML, an idealized aspect-oriented programming
language, by giving a type-directed translation from its user-friendly external language to its …

Key ideas in programming language design and implementation explained using a simple
and concise framework; a comprehensive introduction suitable for use as a textbook or a …