User loginNavigation 
Question from Pierce's Types and Programming LanguagesOn page 56 at the top of the page he has the reduction: ( Î»x . x ( Î»x . x ) )( u r ) evaluates to u r ( Î»x . x ) My question is: I see how the lhs can be written as: (id(id))(ur) which is then (id)(ur). What I don't get is: (id)(ur) = (ur)(id). Is the point that the identity term is commutative in this context? Is this the same idea as the composition operation between functions in that the composition of two functions is generally not commutative, but the identity function is always commutative? By markt at 20080126 13:21  LtU Forum  previous forum topic  next forum topic  other blogs  3184 reads

Browse archivesActive forum topics 
Recent comments
2 hours 44 min ago
4 hours 29 min ago
14 hours 2 min ago
15 hours 36 min ago
2 days 14 hours ago
2 days 17 hours ago
4 days 12 hours ago
4 days 12 hours ago
4 days 19 hours ago
4 days 21 hours ago