Selected papers that cite this one
- Roel Bloo, Fairouz Kamareddine, and Rob Nederpelt. The Barendregt cube with definitions and generalised reduction. Information and Computation, 126(2):123-143, 1 May 1996.
- Trevor Jim. What are principal typings and what are they good for? In Conference Record of POPL '96: The 23rd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pages 42-53, St. Petersburg Beach, Florida, 21-24 January 1996.
- A. J. Kfoury and J. Tiuryn. Type reconstruction in finite rank fragments of the second-order lambda-calculus. Information and Computation, 98(2):228-257, June 1992.
- John Mitchell and Ramesh Viswanathan. Standard ML-NJ weak polymorphism and imperative constructs. Information and Computation, 127(2):102-116, 15 June 1996.
- Morten Heine Sørensen. Strong normalization from weak normalization in typed lambda-calculi. Information and Computation, 133(1):35-71, 25 February 1997.
- Pawe{\l} Urzyczyn. Type reconstruction in F_\omega. Mathematical Structures in Computer Science, 7(4):329-358, August 1997.
Selected references
- Ashok K. Chandra, Dexter C. Kozen, and Larry J. Stockmeyer. Alternation. Journal of the ACM, 28(1):114-133, January 1981.
- A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. Computational consequences and partial solutions of a generalized unification problem (partial report). In Proceedings, Fourth Annual Symposium on Logic in Computer Science, pages 98-105, Asilomar Conference Center, Pacific Grove, California, 5-8 June 1989. IEEE Computer Society Press.
- A. J. Kfoury, J. Tiuryn, and P. Urzyczyn. The undecidability of the semi-unification problem. Information and Computation, 102(1):83-101, January 1993.