Title :
Names and Symmetry in Computer Science (Invited Tutorial)
Author :
Pitts, Andrew M.
Author_Institution :
Comput. Lab., Univ. of Cambridge, Cambridge, UK
Abstract :
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.
Keywords :
automata theory; computer science; formal languages; set theory; automata; computer science; finiteness modulo symmetry; languages; mathematical theory; names; nominal sets; programming; Automata; Cognition; Computer science; Computers; Semantics; Syntactics; Tutorials;
Conference_Titel :
Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on
Conference_Location :
Kyoto
DOI :
10.1109/LICS.2015.12
