This little book comes from a short graduate course on typed λ-calculus given at the
Université Paris VII in the autumn term of 1986–7. It is not intended to be encyclopedic—the …

The Formal Semantics of Programming Languages provides the basic mathematical
techniques necessary for those who are beginning a study of the semantics and logics of …

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 …

Trace properties, which have long been used for reasoning about systems, are sets of
execution traces. Hyperproperties, introduced here, are sets of trace properties …

A theory of lazy λ-calculus is developed as a basis for lazy functional programming
languages. This is motivated by a mismatch between the" standard"(ie, sensible) theory of …

Semantics of Programming Languages exposes the basic motivations and philosophy
underlying the applications of semantic techniques in computer science. It introduces the …

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 …

A brief overview is presented of MetiTarski 4, an automatic theorem prover for real-valued
special functions: ln, \exp, sin, cos, etc. MetiTarski operates through a unique interaction …

The area of coalgebra has emerged within theoretical computer science with a unifying
claim: to be the mathematics of computational dynamics. It combines ideas from the theory of …

In this paper, we present Majority-Inverter Graph (MIG), a novel logic representation
structure for efficient optimization of Boolean functions. An MIG is a directed acyclic graph …