Abstract
In this paper an alternative description of the game semantics for the
untyped lambda calculus is given. More precisely, we introduce a finitary
description of lambda terms. This
description turns out to be equivalent to a particular
game denotational semantics of the lambda calculus.