INF1A: Week 2

In the second week of the course we'll talk about lists, the use of list comprehensions to define and compute with lists, and recursion.

• FP Lecture 2: Lists and Comprehensions (code)
• FP Lecture 3: Lists and Recursion (code)

The functions toLower and isAlpha are in the library Data.Char, not in the Haskell Prelude. To try the examples involving these functions in Lecture 2, you need to first do

import Data.Char

FP required reading: Textbook

• Chapter 5. Lists and Comprehensions
• Chapter 7. Testing Your Programs
• Chapter 10. Lists and Recursion

This week we'll learn about Aristotelian Syllogisms. We'll revisit Venn diagrams and study different types of syllogisms.

Slides for the week:

• CL-Week02.pdf

CL Required reading: Textbook

• Chapter 6. Features and Predicates 
• Chapter 8. Patterns of Reasoning
• Chapter 9. More Patterns of Reasoning