Semantics of

Programming

Languages

Home

Literature

Assignments

Exams

Mailing List

All exercises of this assignment are taken from Mitchell's book.

Due Date: Wednesday, November 21st, 2001.

Number | Page | Points |
---|---|---|

2.5.18 | 113 | 15 |

2.6.3 | 125 | 20 |

2.6.4 (b) | 125 | 10 |

2.6.5 | 130 | 10 |

2.6.6 | 130 | 20 |

3.3.4 | 151 | 10 |

3.3.10 | 155 | 15 |

Total | 100 |

*Exercise 2.6.3:*Part (c) is the most difficult part of Exercise 2.6.3. It becomes simple if you proceed as follows.- Show
(lambda x. case x f g) o Inleft = f (lambda x. case x f g) o Inright = g

- Show
h (case x f g) = case x (h o f) (h o g)

- Show
f (if M then N else P) = if M then f N else f P

- Show
*Exercise 2.6.4:*You are only required to do (b), where you can use (a). If you are looking for a challenge, try (a). The first who finds a solution for 2.6.4 (a) will be awarded a bottle of Prosecco.

Thorsten Brunklaus, Last Change: Wed Jun 6 13:51:02 2018.