Names and Symmetry in Computer Science (Invited Tutorial)

Andrew M. Pitts · 2015

Nominal sets provide a mathematical theory for some of the key concepts that arise when representing and computing with data involving atomic (or 'pure') names: freshness, abstraction and scoping of names, and finiteness modulo symmetry. This tutorial introduces the notion of nominal set and explains selected applications of it to logic in computer science, to automata, languages and programming.

Read the paper · More papers on PaperTik