INF1A: Week 5
| Functional Programming | In the fifth week of the course we'll talk about algebraic data types and begin on expression trees.
FP required reading: Textbook
|
| Computation and Logic | On Monday we will review the sequent calculus for propositional logic, and then move into examples class mode - please come with questions. If you get bored with this, we will look at the full sequent calculus for first-order logic (non-testably). On Tuesday, we'll have a (probably shortish) strictly optional lecture about mediaeval logic and syllogisms. There are no public slides for this lecture; I'll put them on Learn the previous day.
No new reading this week. |
| Mathematics for Computing | We encourage you to read chapter 5 on Proofs. This will be helpful for other courses as well, such as Introduction to Linear Algebra. |
Tutorial 5 - tutorial pack
This tutorial is different. Treat it like a test and complete it without consulting other people. There is an electronic declaration to sign saying it is your own work.
FP and CL Tutorial 5 sessions are held in Week 6.
Direct search links to materials on Learn (note that the tutorial materials only become available after the deadline of the previous tutorial):
License
All rights reserved The University of Edinburgh