1. Design programming language type constructors based on set intersection and set complement. What would the representations and sets of supported operations be like? Why do you think programming languages do not usually have such type?

2.

Give the ML type corresponding to each of the following sets:

a) {true, false}

b) {true, false} --> {true, false}

c) {(true, true), (true, false), (false, true), (false, false)}