INF1A: Week 7

In the seventh week of the course, in the Functional Programming strand, we'll finish data representation and data abstraction. We will also talk about the combination of laziness and higher-order functions, and about sorting. You will learn a bit about laziness and see different ways to sort lists.

• FP lecture 12-13: Data Representation and Data Abstraction, continued from last week
• FP lecture 14: Laziness, Higher-order, Sorting (code)

FP required reading: Textbook

• Chapter 21: Data Abstraction

For CL Week 7, we continue our study of DNF and CNF, and implement it using the techniques you learned in FP last week. We will apply CNF satisfiability checking to the question of solving Sudoku puzzles. 

• CL-13-14: Satisfiability Checking and DPLL
• CL-Week07.hs

CL Required Reading

• Chapter 19 of the textbook.