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 …

Repetitive and ambiguous visual structures in general pose a severe problem in many
computer vision applications. Identification of incorrect geometric relations between images …

This paper formalises within first-order logic some common practices in computer science to
do with representing and reasoning about syntactical structures involving lexically scoped …

How close are we to a world where every paper on programming languages is
accompanied by an electronic appendix with machine-checked proofs? We propose an …

Formal systems that describe computations over syntactic structures occur frequently in
computer science. Logic programming provides a natural framework for encoding and …

Machine-checked proofs of properties of programming languages have become acritical
need, both for increased confidence in large and complex designsand as a foundation for …

This book aims to synthesize different directions in knowledge studies into a unified theory of
knowledge and knowledge processes. It explicates important relations between knowledge …

We present a generalisation of first-order unification to the practically important case of
equations between terms involving binding operations. A substitution of terms for variables …

We present a logic that can express properties of freshness, secrecy, structure, and behavior
of concurrent systems. In addition to standard logical and temporal operators, our logic …

This paper describes a formalisation of the lambda-calculus in a HOL-based theorem prover
using nominal techniques. Central to the formalisation is an inductive set that is bijective with …