This new edition of Introduction to Lattices and Order presents a radical reorganization and
updating, though its primary aim is unchanged. The explosive development of theoretical …

Is the exponential function computable? Are union and intersection of closed subsets of the
real plane computable? Are differentiation and integration computable operators? Is zero …

Notice: This PDF version was distributed by request to members of the Friends of the SEP
Society and by courtesy to SEP content contributors. It is solely for their fair use …

An intensional model for the programming language PCF is described in which the types of
PCF are interpreted by games and the terms by certain history-free strategies. This model is …

This unique book on modern topology looks well beyond traditional treatises and explores
spaces that may, but need not, be Hausdorff. This is essential for domain theory, 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 …

Software verification has emerged as a key concern for ensuring the continued progress of
information technology. Full verification generally requires, as a crucial step, equip** each …

Combinatory logic and lambda-calculus, originally devised in the 1920s, have since
developed into linguistic tools, especially useful in programming languages. The authors' …

Part I of this book is a practical introduction to working with the Isabelle proof assistant. It
teaches you how to write functional programs and inductive definitions and how to prove …

Monoidal Topology describes an active research area that, after various past proposals on
how to axiomatize'spaces' in terms of convergence, began to emerge at the beginning of the …