1. R. Aubin. Some generalization heuristics in proofs by induction. In G. Huet and G. Kahn, editors, Actes du Colloque Construction: Amélioration et vérification de Programmes. Institut de recherche d'informatique et d'automatique, 1975.
2. S. Baker. Notes on the constructive omega rule and a new method of generalisation. Discussion Paper 102, Dept. of Artificial Intelligence, Edinburgh, 1990.
3. R.S. Boyer and J.S. Moore. A Computational Logic Handbook. Academic Press, Boston, 1988.
4. M.R. Donat and L.A. Wallen. Learning and applying generalised solutions using higher order resolution. In E. Lusk and R. Overbeek, editors, Lecture Notes in Computer Science, volume 310, pages 41–60. Springer-Verlag, 1988.
5. S. Feferman. Transfinite recursive progressions of axiomatic theories. Journal of Symbolic Logic, 27:259–316, 1962.