1. Clark Barrett, Aaron Stump & Cesare Tinelli (2010): The SMT-LIB Standard: Version 2.0. Technical Report. University of Iowa.
  2. Mikołaj Bojańczyk, Laurent Braud, Bartek Klin & Sławomir Lasota (2012): Towards nominal computation. In: Procs. POPL 2012, pp. 401–412, doi:10.1145/2103656.2103704.
  3. Mikołaj Bojańczyk, Bartek Klin & Sławomir Lasota (2014): Automata theory in nominal sets. Log. Meth. Comp. Sci. 10, doi:10.2168/LMCS-10(3:4)2014.
  4. Leonardo De Moura & Nikolaj Bjørner (2008): Z3: An Efficient SMT Solver. In: Procs. of TACAS'08, pp. 337–340, doi:10.1007/978-3-540-78800-3_24.
  5. Jean-Yves Girard, Paul Taylor & Yves Lafont (1989): Proofs and Types. Cambridge University Press.
  6. Martin Grohe (2008): The quest for a logic capturing PTIME. In: Procs. LICS'08, pp. 267–271, doi:10.1109/LICS.2008.11.
  7. Wilfried Hodges (1993): Model theory. Cambridge University Press, doi:10.1017/CBO9780511551574.
  8. Jan Hubička & Jaroslav Nešetřil (2005): Universal partial order represented by means of oriented trees and other simple graphs. European Journal of Combinatorics 26, pp. 765–778, doi:10.1016/j.ejc.2004.01.008.
  9. Bartek Klin, Eryk Kopczyński, Joanna Ochremiak & Szymon Toruńczyk (2015): Locally Finite Constraint Satisfaction Problems. In: Procs. LICS 2015, pp. 475–486, doi:10.1109/LICS.2015.51.
  10. Eryk Kopczyński & Szymon Toruńczyk: Looping over infinite sets. To appear.
  11. Rüdiger Loos & Volker Weispfenning (1993): Applying Linear Quantifier Elimination. The Computer Journal 36(5), pp. 450–462, doi:10.1093/comjnl/36.5.450.
  12. Tobias Nipkow (2008): Linear Quantifier Elimination. In: Alessandro Armando, Peter Baumgartner & Gilles Dowek: Automated Reasoning, Lecture Notes in Computer Science 5195. Springer, pp. 18–33, doi:10.1007/978-3-540-71070-7_3.
  13. . Available from
  14. Joanna Ochremiak (2016): Extended constraint satisfaction problems. University of Warsaw.
  15. Andrew M. Pitts (2013): Nominal Sets: Names and Symmetry in Computer Science. Cambridge University Press, doi:10.1017/CBO9781139084673.
  16. F. Rossi, P. van Beek & T. Walsh (2006): Handbook of Constraint Programming. Elsevier.
  17. J. T. Schwartz, R. B. Dewar, E. Schonberg & E. Dubinsky (1986): Programming with Sets; an Introduction to SETL. Springer-Verlag.
  18. Mark R. Shinwell (2006): Fresh O'Caml: Nominal Abstract Syntax for the Masses. Electr. Notes Theor. Comput. Sci. 148(2), pp. 53–77, doi:10.1016/j.entcs.2005.11.040.
  19. M. Takahashi (1995): Parallel reductions in λ-calculus. Information and Computation 118(1), pp. 120 – 127, doi:10.1006/inco.1995.1057.

Comments and questions to:
For website issues: