Imperative Programming in Sets with Atoms

Authors Mikolaj Bojanczyk, Szymon Torunczyk

Thumbnail PDF


  • Filesize: 451 kB
  • 12 pages

Document Identifiers

Author Details

Mikolaj Bojanczyk
Szymon Torunczyk

Cite AsGet BibTex

Mikolaj Bojanczyk and Szymon Torunczyk. Imperative Programming in Sets with Atoms. In IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012). Leibniz International Proceedings in Informatics (LIPIcs), Volume 18, pp. 4-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)


We define an imperative programming language, which extends while programs with a type for storing atoms or hereditarily orbit-finite sets. To deal with an orbit-finite set, the language has a loop construction, which is executed in parallel for all elements of an orbit-finite set. We show examples of programs in this language, e.g. a program for minimising deterministic orbit-finite automata.
  • Nominal sets
  • sets with atoms
  • while programs


  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    PDF Downloads