Lower Bounds on Type Inference with Subtypes

@inproceedings{Hoang1995LowerBO,
  title={Lower Bounds on Type Inference with Subtypes},
  author={My Hoang and John C. Mitchell},
  booktitle={POPL},
  year={1995}
}
We investigate type inference for programming languages with subtypes. As described in previous work, there are several type inference problems for any given expression language, depending on the form of the subtype partial order and the ability to define new subtypes in programs. Our first main result is that for any specific subtype partial order, the problem of determining whether a lambda term is typable is algorithmically (polynomial-time) equivalent to a form of satisfiability problem… CONTINUE READING