Sciweavers

85
Voted
APAL
2008
79views more  APAL 2008»
15 years 16 days ago
Parameter-free polymorphic types
Consider the following restriction of the polymorphically typed lambda calculus ("System F"). All quantifications are parameter free. In other words, in every universal ...
Klaus Aehlig