Questions tagged [system-f]
19 questions
1
vote
1 answer
Polymorphic self application
I have an example of System F plymorphism that I don't really understand:
If I would remove the types it would remain:
\f.\a.f (f a) which makes no sense.
Can you help me with this?
Thank you!
yonutix
- 1,964
- 1
- 22
- 51
1
vote
1 answer
Modeling System F's parametric polymorphism at Set₀
In System F, the kind of a polymorphic type is * (as that's the only kind in System F anyway...), so e.g. for the following closed type:
[] ⊢ (forall α : *. α → α) : *
I would like to represent System F in Agda, and because everything is in *, I…
Cactus
- 27,075
- 9
- 69
- 149
0
votes
1 answer
Unable to understand F-omega term
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…
shikantaza
- 1
- 2
-1
votes
1 answer
Which is the difference between these polymorphic types?
In System F, what is the difference between the following 3 types:
Reproduced in text here:
∀X.((X → X) → (X → X))
∀X.((X → X) → ∀X.(X → X))
((∀X.X → X) → (∀X.X → X))
Is the second one more general than the first?
yonutix
- 1,964
- 1
- 22
- 51