Explain why if a reduction system is confluent, then each term has at most one normal form. Show leftmost-outermost and leftmost-innermost reductions for the following terms: – G (F x) where G =...

Explain why if a reduction system is confluent, then each term has at most

one normal form.

Show leftmost-outermost and leftmost-innermost reductions for the following terms:

– G (F x) where

G = λx.xxx

F = λyz.yz

– ΘΘΘ

– Θ(ΘΘ)

where

Θ = λx.xKSK

S = λxyz.xz(yz)

K = λxy.x