The complexity of type inference for higher-order typed lambda calculi (1994)

by F Henglein, H G Mairson
Venue:PARAMETERIZED HARDNESS AND COMPLETENESS Page 19 of 21 THE COMPUTER JOURNAL, 2007