Imperative Programming in Sets with Atoms

Bojanczyk, Mikolaj; Torunczyk, Szymon

doi:10.4230/LIPIcs.FSTTCS.2012.4

Document

Imperative Programming in Sets with Atoms

Authors Mikolaj Bojanczyk, Szymon Torunczyk

Part of: Volume: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2012)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS)
License: Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported license
Publication Date: 2012-12-14

PDF

File

PDF

LIPIcs.FSTTCS.2012.4.pdf

Filesize: 451 kB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.FSTTCS.2012.4
URN: urn:nbn:de:0030-drops-38437

Subject Classification

Keywords

Nominal sets
sets with atoms
while programs

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

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.

Cite As Get 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) https://doi.org/10.4230/LIPIcs.FSTTCS.2012.4

Author Details

Mikolaj Bojanczyk

Szymon Torunczyk

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail