Imperative programming in sets with atoms

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 18, Issue , 2012, Pages 4-15

  Bojańczyk, Mikołaj ^a   Toruńczyk, Szymon ^a  

^a UNIVERSITY OF WARSAW   (Poland)

Author keywords

Nominal sets; Sets with atoms; While programs

Indexed keywords

IMPERATIVE PROGRAMMING; IMPERATIVE PROGRAMMING LANGUAGES; NOMINAL SETS; WHILE-PROGRAMS;

ATOMS; ORBITS; SOFTWARE ENGINEERING;

SET THEORY;

EID: 84880211248     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.FSTTCS.2012.4     Document Type: Conference Paper

References (10)

1. Jon Barwise. Admissible sets and structures. Springer-Verlag, Berlin, 1975. An approach to definability theory, Perspectives in Mathematical Logic.
2. Jon Barwise, editor. Handbook of Mathematical Logic. Number 90 in Studies in Logic and the Foundations of Mathematics. North-Holland, 1977.
3. Mikolaj Bojanczyk. Data monoids. In STACS, pages 105-116, 2011.
4. Mikolaj Bojanczyk, Laurent Braud, Bartek Klin, and Slawomir Lasota. Towards nominal computation. In POPL, pages 401-412, 2012.
5. Mikolaj Bojanczyk, Bartek Klin, and Slawomir Lasota. Automata with group actions. In LICS, pages 355-364, 2011.
6. Roland Fraïssé. Theory of relations, volume 145 of Studies in Logic and the Foundations of Mathematics. North-Holland Publishing Co., Amsterdam, revised edition, 2000. With an appendix by Norbert Sauer.
7. Murdoch Gabbay and Andrew M. Pitts. A new approach to abstract syntax with variable binding. Formal Asp. Comput., 13(3-5):341-363, 2002.
8. C. Ward Henson. A family of countable homogeneous graphs. Pacific J. Math., 38:69-83, 1971.
9. Thomas Jech. The Axiom of Choice. North-Holland, 1973.
10. Michael Kaminski and Nissim Francez. Finite-memory automata. Theor. Comput. Sci., 134(2):329-363, 1994.