I am reading a paper on Fω, and cannot understand the reasoning behind this statement:
The type term of type (∀γ:*. F γ → β) shows that F is a constant function that always returns β.
I guess 'F γ → β' is the type term, i.e., an arrow type. This arrow type is the type of a function that takes an argument of type computed by the type application 'F γ' and returns a value of type β.
If this is the case, why should F be a constant (type) function that always returns β? Can't it be any arbitrary type function, one that returns, say, α, and still satisfy the typechecker?
Thanks for your time.