1. Lecture Notes in Computer Science;M. Hanus,1989
2. Hanus, M.: Polymorphic higher-order programming in Prolog. In: Levi, G., Martelli, M. (eds.) Proceedings of the Sixth International Logic Programming Conference, pp. 382–398. MIT Press, Cambridge (1989)
3. Huet, G.: A unification algorithm for typed λ-calculus. Theoretical Computer Science 1, 27–57 (1975)
4. Kwon, K., Nadathur, G., Wilson, D.S.: Implementing polymorphic typing in a logic programming language. Computer Languages 20(1), 25–42 (1994)
5. Lakshman, T.K., Reddy, U.S.: Typed Prolog: A semantic reconstruction of the Mycroft-O’Keefe type system. In: Saraswat, V., Ueda, K. (eds.) Proceedings of the International Logic Programming Symposium, pp. 202–217. MIT Press, Cambridge (1991)