Bounded Quantification is Undecidable

  title={Bounded Quantification is Undecidable},
  author={Benjamin C. Pierce},
  journal={Inf. Comput.},
F< is a typed A-calculus with subtyping and bounded second-order polymorphism. First introduced by Cardelli and Wegner, it has been widely studied as a core calculus for type systems with subtyping. Curien and Ghelli proved the partial correctness of a recursive procedure for computing minimal types of F< terms and showed that the termination of this procedure is equivalent to the termination of its major component, a procedure for checking the subtype relation between F< types. Ghelli later… CONTINUE READING

From This Paper

Topics from this paper.
5 Citations
28 References
Similar Papers


Publications referenced by this paper.
Showing 1-10 of 28 references

F-bounded quantification for object-oriented programming

  • Peter Canning, William Cook, Walter Hill, Walter Olthoff, John Mitchell
  • In Fourth International Conference on Functional…
  • 1989
Highly Influential
9 Excerpts

Extensible records in a. pure calculus of subtyping

  • Luca Cardelli
  • To appear,
  • 1991
2 Excerpts

Similar Papers

Loading similar papers…