a) Give an interaction system to compute the Boolean function and. b) Draw the interaction net representing the expression (T rue and F alse) and T rue How many reductions are needed to fully...

a) Give an interaction system to compute the Boolean function and.

b) Draw the interaction net representing the expression

(T rue and F alse) and T rue

How many reductions are needed to fully normalise this net?

c) Modify the system so that the result is T rue if and only if both arguments have the same value (i.e., both T rue or both F alse).