• DocumentCode
    728958
  • Title

    Names and Symmetry in Computer Science (Invited Tutorial)

  • Author

    Pitts, Andrew M.

  • Author_Institution
    Comput. Lab., Univ. of Cambridge, Cambridge, UK
  • fYear
    2015
  • fDate
    6-10 July 2015
  • Firstpage
    21
  • Lastpage
    22
  • 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;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Logic in Computer Science (LICS), 2015 30th Annual ACM/IEEE Symposium on
  • Conference_Location
    Kyoto
  • ISSN
    1043-6871
  • Type

    conf

  • DOI
    10.1109/LICS.2015.12
  • Filename
    7174866
    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=49&DC=728958