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 2008-01-26 13:21 | LtU Forum | previous forum topic | next forum topic | other blogs | 4710 reads
|
Browse archives
Active forum topics |
Recent comments
6 weeks 6 days ago
6 weeks 6 days ago
6 weeks 6 days ago
13 weeks 6 hours ago
1 year 1 week ago
1 year 1 week ago
1 year 1 week ago
1 year 23 weeks ago
1 year 27 weeks ago
1 year 29 weeks ago