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  4361 reads

Browse archivesActive forum topics 
Recent comments
1 week 6 days ago
2 weeks 6 days ago
5 weeks 1 day ago
5 weeks 6 days ago
6 weeks 40 min ago
6 weeks 2 days ago
6 weeks 2 days ago
6 weeks 3 days ago
6 weeks 3 days ago
6 weeks 4 days ago