论文信息 - Local Type Argument Synthesis with Bounded Quantification

Local Type Argument Synthesis with Bounded Quantification

In a companion paper [PT98], we introduced a local type inference method for inferring type arguments to polymorphic functions. We show here how our method can be extended to handle Cardelli and Wegner's Kernel Fun variant of F .

B. Pierce | D. Turner

[1] Luca Cardelli,et al. On understanding types, data abstraction, and polymorphism , 1985, CSUR.

[2] Luca Cardelli,et al. An Extension of System F with Subtyping , 1991, TACS.

[3] Giorgio Ghelli,et al. Coherence of Subsumption, Minimum Typing and Type-Checking in F<= , 1992, Math. Struct. Comput. Sci..

[4] B. Pierce. Bounded Quanti cation with Bottom , 1997 .

[5] Benjamin C. Pierce,et al. Bounded Existentials and Minimal Typing , 1998, Theor. Comput. Sci..

[6] Benjamin C. Pierce,et al. Local type inference , 1998, POPL '98.