Summary: Sheet 9 - Solution
In the following solution, the labels and the V al in the denition of the semantic of a simple
Haskell-program are dropped for readibility.
Exercise 1
[[exp 1 ]]  = [[let not 0 = x ! if x == T rue then F alse else T rue in not 0 y]] 
= [[not 0 y]] +fnot 0 =lfp fg
f(d) = [[x ! if x == T rue then F alse else T rue]] +fnot 0 =dg
= g : g(e) = [[if x == T rue then F alse else T rue]] +fnot 0 =d;x=eg=: 2
= g : g(e) =
8
<
:
[[F alse]] 2 ; [[x == T rue]] 2 = T rue
[[T rue]]  2
; [[x == T rue]]  2
= F alse
? ; otherwise
= g : g(e) =
8
<

Source: Ábrahám, Erika - Fachgruppe Informatik, Rheinisch Westfälische Technische Hochschule Aachen (RWTH)

Collections: Computer Technologies and Information Sciences