|
|
|
|
|
|
by kevindamm
866 days ago
|
|
|
System F is a polymorphic lambda calculus, it's more theoretical than practical (typing must be explicit or type inference may be impossible) but a restriction of its typing scheme is one you may have heard of, and the Hindley-Milner type inference algorithm works for it. https://en.m.wikipedia.org/wiki/System_F |
|
|