The Complexity of Type Inference for Higher-Order Typed Lambda Calculi (1991)

Cached

Download Links

by Fritz Henglein , Harry G. Mairson
Venue:J. Funct. Programming
Citations:28 - 11 self

Document Versions

The complexity of type inference for higher-order typed lambda calculi –Fritz Henglein, Harry G. Mairson — 1991 — In. Proc. 18th ACM Symposium on the Principles of Programming Languages
The Complexity of Type Inference for Higher-Order Typed Lambda Calculi –Fritz Henglein, Harry G. Mairson — 1991 — J. Funct. Programming