Bibliography
| Andrew W. Appel, Robert Dockins, and Xavier Leroy. A list-machine benchmark for mechanized metatheory. Journal of Automated Reasoning 49(3), pp. 453–491, 2012. http://www.cs.princeton.edu/~appel/listmachine/ | 
| Kenneth V. Hanford. Automatic generation of test cases. IBM Systems Journal 9(4), pp. 244–257, 1970. http://dl.acm.org/citation.cfm?id=1663480 | 
| Casey Klein, Robert Bruce Findler, and Matthew Flatt. The Racket virtual machine and randomized testing. Higher-Order and Symbolic Computation, 2013. http://plt.eecs.northwestern.edu/racket-machine/ | 
| John McCarthy. A Basis for a Mathematical Theory of Computation. In Computer Programming And Formal Systems by P. Braffort and D. Hirschberg (Ed.), 1963. http://www-formal.stanford.edu/jmc/basis.html | 
| Michał H. Pałka, Koen Claessen, Alejandro Russo, and John Hughes. Testing an Optimising Compiler by Generating Random Lambda Terms. In Proc. International Workshop on Automation of Software Test, 2011. http://dl.acm.org/citation.cfm?id=1982615 | 
| Asumu Takikawa, T. Stephen Strickland, and Sam Tobin-Hochstadt. Constraining Delimited Control with Contracts. In Proc. European Symposium on Programming, pp. 229–248, 2013. http://dl.acm.org/citation.cfm?id=2450287 | 
| Ramin Zabih, David McAllester, and David Chapman. Non-deterministic Lisp with dependency-directed backtracking. In Proc. Proceedings of the Sixth National Conference on Artificial Intelligence, pp. 59–64, 1987. |