A comprehensive introduction to type systems and programming languages. A type system
is a syntactic method for automatically checking the absence of certain erroneous behaviors …

This text develops a comprehensive theory of programming languages based on type
systems and structural operational semantics. Language concepts are precisely defined by …

Most books on data structures assume an imperative language such as C or C++. However,
data structures for these languages do not always translate well to functional languages …

Graphical user interfaces (GUIs) mediate many of our interactions with computers.
Functional Reactive Programming (FRP) is a promising approach to GUI design, providing …

We have built the first family of tagless interpretations for a higher-order typed object
language in a typed metalanguage (Haskell or ML) that require no dependent types …

Functional logic languages have a rich literature, but it is tricky to give them a satisfying
semantics. In this paper we describe the Verse calculus, VC, a new core calculus for …

Focusing on path-dependent types, the paper develops foundations for Scala from first
principles. Starting from a simple calculus D _<:<: of dependent functions, it adds records …

Many compilers do some of their work by means of correctness-preserving, and hopefully
performance-improving, program transformations. The Glasgow Haskell Compiler (GHC) …

We introduce a positive supercompiler, a version of Turchin's supercompiler maintaining
only positive information during transformation, and using folding without generalization …

We present a calculus that captures the operational semantics of call-by-need. The call-by-
need lambda calculus is confluent, has a notion of standard reduction, and entails the same …