User loginNavigation 
Weak normalisation theorem for typed lambdacalculusHi, There is something that seems strange to me. It says that: The degree &(T) of a type is defined by: The degree &(r) of a redex is defined by: Reading this it seems to me that a redex has the degree of its type. Am I wrong? Anyway, after it says: Note that, if r is a redex of type T, then &(r) > &(T). Why should &(r) be greater than &(T)? thanks, By ilSignorCarlo at 20071206 17:02  LtU Forum  previous forum topic  next forum topic  other blogs  4011 reads

Browse archivesActive forum topics 
Recent comments
4 hours 51 min ago
13 hours 46 min ago
1 day 43 min ago
1 day 1 hour ago
1 day 2 hours ago
1 day 3 hours ago
1 day 3 hours ago
1 day 5 hours ago
1 day 7 hours ago
1 day 8 hours ago