1. The Lambda Calculus: Its Syntax and Semantics;Barendregt,1984
2. H.-J. Boehm, Partial polymorphic type inference is undecidable, in: 26th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, October 1985, pp. 339–345, ISBN: 0-8186-0644-4.
3. Luca Cardelli, An implementation of FSub, Research Report 97, Digital Equipment Corporation Systems Research Center, 1993.
4. Sébastien Carlier, Jeff Polakow, J.B. Wells, A.J. Kfoury, System e: expansion variables for flexible typing with linear and non-linear types and intersection types, in: David A. Schmidt (Ed.), Prooceedings of the 13th European Symposium on Programming, Lecture Notes in Computer Science, vol. 2986, Springer, 2004, pp. 294–309, ISBN: 978-3-540-21313-0.
5. Gilles Dowek, Thérèse Hardin, Claude Kirchner, Frank Pfenning, Higher-order unification via explicit substitutions: the case of higher-order patterns, in: M. Maher (Ed.), Joint International Conference and Symposium on Logic Programming, 1996, pp. 259–273.