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 …

As its title promises, this book provides foundations for software specification and formal
software development from the perspective of work on algebraic specification. It …

Abstract Development of formal proofs of correctness of programs can increase actual and
perceived reliability and facilitate better understanding of program specifications and their …

We present the design and implementation of a typechecker for verifying security properties
of the source code of cryptographic protocols and access control mechanisms. The …

While type soundness proofs are taught in every graduate PL class, the gap between
realistic languages and what is accessible to formal proofs is large. In the case of Scala, it …

We present the first type and effect system for proving authenticity properties of security
protocols based on asymmetric cryptography. The most significant new features of our type …

Coercive subtyping is a useful and powerful framework of subtyping for type theories. The
key idea of coercive subtyping is subtyping as abbreviation. In this paper, we give a new and …

Session types have emerged as a typing discipline for communication protocols. Existing
calculi with session types come equipped with many different primitives that combine …

With Java 5 and C# 2.0, first-order parametric polymorphism was introduced in mainstream
object-oriented programming languages under the name of generics. Although the first …

Dependent Object Types (DOT) is a calculus with path dependent types, intersection types,
and object self-references, which serves as the core calculus of Scala 3. Although the …