The complexity of type inference for higher-order lambda calculi

  • Authors:
  • Fritz Henglein;Harry G. Mairson

  • Affiliations:
  • Courant Institute of Mathematical Sciences, New York University, New York, N.Y. and Computer Science Department, Utrecht University, 3508 TB Utrecht, The Netherlands;Computer Science Department, Brandeis University, Waltham, Massachusetts

  • Venue:
  • POPL '91 Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
  • Year:
  • 1991

Quantified Score

Hi-index 0.00

Visualization

Abstract