Summary: Solution Proposal Functional Programming ­ Sheet 13
Exercise 1
(a) W(A0, x. if True (x Nil) (x 1))
W(A0 + {x :: b1}, if True (x Nil) (x 1))
W(A0 + {x :: b1}, if True (x Nil)) 1
W(A0 + {x :: b1}, if True)
W(A0 + {x :: b1}, if)
= (id, Bool b2 b2 b2)
W(A0 + {x :: b1}, True)
= (id, Bool)
mgu(Bool b2 b2 b2, Bool b3) = [b3/b2 b2 b2]
= ([b3/b2 b2 b2], b2 b2 b2)
W(A0 + {x :: b1}, (x Nil))
W(A0 + {x :: b1}, x)
= (id, b1)
W(A0 + {x :: b1}, Nil)
= (id, List b4)
mgu(b1, List b4 b5) = [b1/List b4 b5]
= ([b1/List b4 b5], b5)
mgu(b2 b2 b2, b5 b6) = [b5/b2, b6/b2 b2] 2

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

Collections: Computer Technologies and Information Sciences