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.
Eryk Kopczyński & Szymon Toruńczyk:
Looping over infinite sets.
To appear.
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.
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.
Nλ.
Available from http://www.mimuw.edu.pl/~szynwelski/nlambda/.
Joanna Ochremiak (2016):
Extended constraint satisfaction problems.
University of Warsaw.
Andrew M. Pitts (2013):
Nominal Sets: Names and Symmetry in Computer Science.
Cambridge University Press,
doi:10.1017/CBO9781139084673.
F. Rossi, P. van Beek & T. Walsh (2006):
Handbook of Constraint Programming.
Elsevier.
J. T. Schwartz, R. B. Dewar, E. Schonberg & E. Dubinsky (1986):
Programming with Sets; an Introduction to SETL.
Springer-Verlag.
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.
M. Takahashi (1995):
Parallel reductions in λ-calculus.
Information and Computation 118(1),
pp. 120 – 127,
doi:10.1006/inco.1995.1057.