A
Andrew M. Pitts
Researcher at University of Cambridge
Publications - 105
Citations - 5543
Andrew M. Pitts is an academic researcher from University of Cambridge. The author has contributed to research in topics: Operational semantics & Denotational semantics. The author has an hindex of 35, co-authored 104 publications receiving 5292 citations. Previous affiliations of Andrew M. Pitts include Imperial College London & University of Sussex.
Papers
More filters
Journal ArticleDOI
A New Approach to Abstract Syntax with Variable Binding
TL;DR: Inductively defined FM-sets involving the name-abstraction set former can correctly encode syntax modulo renaming of bound variables, and the standard theory of algebraic data types can be extended to encompass signatures involving binding operators.
Journal ArticleDOI
Nominal Logic: A First Order Theory of Names and Binding
TL;DR: Nominal Logic is introduced, a version of first-order many-sorted logic with equality containing primitives for renaming via name-swapping, for freshness of names, and for name-binding, and its axioms express properties of these constructs satisfied by the FM-sets model of syntax involving binding.
Proceedings ArticleDOI
A new approach to abstract syntax involving binders
TL;DR: The Fraenkel-Mostowski permutation model of set theory with atoms (FM-sets) can serve as the semantic basis of meta-logics for specifying and reasoning about formal systems involving name binding, /spl alpha/-conversion, capture avoiding substitution, and so on as discussed by the authors.
Book
Nominal Sets: Names and Symmetry in Computer Science
TL;DR: The author provides an introduction to the basic theory of nominal sets and surveys some of the applications that have developed in programming language semantics, functional programming and logic programming.
Journal ArticleDOI
Nominal unification
TL;DR: A generalisation of first-order unification to the practically important case of equations between terms involving binding operations, which retains the latter's pleasant properties: unification problems involving α-equivalence and freshness are decidable; and solvable problems possess most general solutions.