Journal of the ACM Bibliography

Selected papers that cite this one

• Erik Barendsen and Marc Bezem. Polymorphic extensions of simple type structures. With an application to bar recursive minimization. Annals of Pure and Applied Logic, 79(3):221-280, 24 June 1996.

• Val Breazu-Tannen and Jean Gallier. Polymorphic rewriting conserves algebraic confluence. Information and Computation, 114(1):1-29, October 1994.

• Loïc Colson and Daniel Fredholm. System T, call-by-value and the minimum problem. Theoretical Computer Science, 206(1-2):301-315, 6 October 1998.

• Matthias Felleisen. On the expressive power of programming languages. Science of Computer Programming, 17(1-3):35-75, December 1991.

• Ryu Hasegawa. Categorical data types in parametric polymorphism. Mathematical Structures in Computer Science, 4(1):71-109, March 1994.

• Leen Helmink. Resolution and type theory. Science of Computer Programming, 17(1-3):119-138, December 1991.

• Gerd Hillebrand and Paris Kanellakis. On the expressive power of simply typed and let-polymorphic lambda calculi. In Proceedings, 11th Annual IEEE Symposium on Logic in Computer Science, pages 253-263, New Brunswick, New Jersey, 27-30 July 1996. IEEE Computer Society Press.

• Gerd G. Hillebrand, Paris C. Kanellakis, and Harry G. Mairson. Database query languages embedded in the typed lambda calculus. Information and Computation, 127(2):117-144, 15 June 1996.

• Simon Peyton Jones, Will Partain, and André Santos. Let-floating: moving bindings to give faster programs. In Proceedings of the 1996 ACM SIGPLAN International Conference on Functional Programming, pages 1-12, Philadelphia, Pennsylvania, 24-26 May 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.

• Gopalan Nadathur and Dale Miller. Higher-order Horn clauses. Journal of the ACM, 37(4):777-814, October 1990.

• Michel Parigot. Proofs of strong normalisation for second order classical natural deduction. The Journal of Symbolic Logic, 62(4):1461-1479, December 1997.

• Kenneth W. Regan. Index sets and presentations of complexity classes. Theoretical Computer Science, 161(1-2):263-287, 15 July 1996.

• Sergei Vorobyov. The ``hardest'' natural decidable theory. In Proceedings, Twelth Annual IEEE Symposium on Logic in Computer Science, pages 294-305, Warsaw, Poland, 29 June-2 July 1997. IEEE Computer Society Press.

• Hirofumi Yokouchi. Embedding a second order type system into an intersection type system. Information and Computation, 117(2):206-220, March 1995.

Shortcuts: