b reduction and a renaming

• The only tricky part of the rules

• e1[e2/x] must replace only FREE occurrences of x in e1 with e2

( l x . ( ( l x . ( + x 3 ) ) ( + x 4 ) ) ) 5

( l x . ( + x 3 ) ) ( + x 4 )

­ FREE x

®b® ( l x . ( + x 3 ) ) ( + 5 4 )

Previous slide

Next slide

Back to first slide

View graphic version