User loginNavigation 
Encoding System Fw in predicative dependent type theorySystem F_{ω} appears impredicative, but I'm wondering if there is an easy way to embed it into predicative dependent type theory by inferring bounds on universes. Also, if anyone can provide an example of a System F_{ω} term that would be rejected by Coq's typical ambiguity resolver, that would be helpful to me. Any references or thought are appreciated. By Matt M at 20120517 14:47  LtU Forum  previous forum topic  next forum topic  other blogs  7396 reads

Browse archivesActive forum topics 
Recent comments
3 hours 4 min ago
3 hours 36 min ago
6 hours 40 min ago
7 hours 5 min ago
8 hours 27 min ago
8 hours 32 min ago
9 hours 2 min ago
13 hours 59 min ago
13 hours 59 min ago
14 hours 10 min ago