Algebraic structures which are generated by a collection of constructors| like natural
numbers (generated by a zero and a successor) or nite lists and trees| are of well …

This text is based on the chapter Domain Theory in the Handbook for Logic in Computer
Science, volume 3, edited by S. Abramsky, Dov M. Gabbay, and TS E. Maibaum, published …

In the semantics of programming, finite data types such as finite lists, have traditionally been
modelled by initial algebras. Later final coalgebras were used in order to deal with infinite …

Nominal sets provide a promising new mathematical analysis of names in formal languages
based upon symmetry, with many applications to the syntax and semantics of programming …

We show how some classical static analyses for imperative programs, and the optimizing
transformations which they enable, may be expressed and proved correct using elementary …

The proofs of" traditional" proof carrying code (PCC) are type-specialized in the sense that
they require axioms about a specific type system. In contrast, the proofs of foundational PCC …

The SLam calculus is a typed λ-calculus that maintains security information as well as type
information. The type system propagates security information for each object in four forms …

The paper (first written in 1969 and circulated privately) concerns the definition,
axiomatization, and applications of the hereditarily monotone and continuous functionals …

A thorough and accessible introduction to a range of key ideas in type systems for
programming language. The study of type systems for programming languages now touches …

We present a sound and complete proof technique, based on syntactic logical relations, for
showing contextual equivalence of expressions in a λ-calculus with recursive types and …