HENGLEIN, F. AND MAIRSON, H. G. 1991. The complexity of type inference for higher-order lambda calculi. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press, 119--130. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
The Liberty Simulation Environment: A Deliberate - Approach To High-Level (Correct)
No context found.
HENGLEIN, F. AND MAIRSON, H. G. 1991. The complexity of type inference for higher-order lambda calculi. In Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages. ACM Press, 119--130.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC