We present a \emph{type assignment system} that provides a \emph{finitary} 
interpretation of lambda terms in a \emph{game semantics} model. Traditionally,
type assignment systems describe the semantic interpretation of terms in domain theoretic models.   
Quite surprisingly, the type assignment system presented in this paper is very similarto the traditional ones, the main difference being the omission of the subtyping rule.