INF1A: Week 4

Functional Programming

In the fourth week of the course we'll introduce higher-order functions starting with map, filter, and fold, and then continue the theme by talking about lambda expressions.

FP required reading: Textbook

  • Chapter 12: Higher-Order Functions
  • Chapter 13: Higher and Higher
Computation and Logic

In the Computation and Logic strand, we'll go beyond the syllogisms and delve into sequent calculus. We will study the negation, conjunction, disjunction rules. Time permitting, we will have a (strictly optional) lecture about the horrors of doing logic in mediaeval times.

CL-7,8: From syllogisms to sequent calculus

Slides for the week are 

CL Required reading

  • Textbook chapter 14, Sequent Calculus

Tutorial 4 - tutorial pack

FP and CL Tutorial 4 sessions are held in Week 5.
 
Direct search links to materials on Learn (note that the tutorial materials only become available after the deadline of the previous tutorial):

FP Tutorial 4 is longer than the previous ones because it repeats explanation of higher-order functions that is in the lectures and textbook.

The number of exercises is similar as is their difficulty, except for the final optional exercise.

License
All rights reserved The University of Edinburgh