A game semantics for generic polymorphism

Full Completeness for ML types (universal closures of quantifier-free types) is proved for this model.