Selected papers that cite this one
- Nevin Heintze and David McAllester. On the cubic bottleneck in subtyping and flow analysis. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 342-351, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.
- David A. McAllester. Automatic recognition of tractability in inference relations. Journal of the ACM, 40(2):284-303, April 1993.
- David A. McAllester, Robert Givan, Carl Witty, and Dexter Kozen. Tarskian set constraints. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 138-147, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.
Selected references
- Peter J. Downey, Ravi Sethi, and Robert Endre Tarjan. Variations on the common subexpression problem. Journal of the ACM, 27(4):758-771, October 1980.
- Dexter Kozen. Complexity of finitely presented algebras. In Conference Record of the Ninth Annual ACM Symposium on Theory of Computing, pages 164-177, Boulder, Colorado, 2-4 May 1977.
- David A. McAllester. Automatic recognition of tractability in inference relations. Journal of the ACM, 40(2):284-303, April 1993.
- Greg Nelson and Derek C. Oppen. Fast decision procedures based on congruence closure. Journal of the ACM, 27(2):356-364, April 1980.
- Christoph Walther. Many-sorted unification. Journal of the ACM, 35(1):1-17, January 1988.