HASKELL Question

a) write a function big_step_b :: BExp -> Bool that evaluates the big-step semantics for BExp.

b) write function prove_b :: BExp -> BSS_BExp that takes a BExp and returns a derivation showing of type BSS_BExp. To do this you need the big step rules for BExp and create a datatype representing the corresponding derivation trees. provide enough tests to exercise all the code.

[EQUALS-1BSs] aj + Vi 02 + V2 aj = 22 tt if vi = 02 [EQUALS-2BS] ai ta vi 02 7a 02 a = 22 + ff if vi + V2 [GREATERTHAN-1Bss] aj ta vi 02 a 02 aj