INF1A: Week 1

The first lecture will explain the basic concepts behind functional programming, including types, values and functions. The second lecture will introduce lists and the use of list comprehensions to define lists.

Slides for the week:

• FP Lecture 1: Functional Programming, Types and Values
• FP Lecture 2: Lists and Comprehensions (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 2. Types
• Chapter 3. Simple Computations
• Chapter 5. Lists and Comprehensions
• Chapter 7. Testing Your Programs

Optional reading:

• Quora: Functional Programming is Black Magic by Jonathan Reem

Binary data & questions. A small universe. Categorical propositions

In the first two lectures, we introduce the basic framework for our discussion of propositional logic. This includes a universe of things, and a collection of predicates, which are properties a thing might have. We look at a chess set as a first example of a universe, and then introduce an even simpler example, which we use to introduce propositions, which are statements we may make about the universe. We briefly mention predicate logic, before pulling back to something simpler.

Slides for the week: 

• CL-Week01.pdf

Required reading: Textbook

• Chapter 1. Sets
• Chapter 4. Venn Diagrams and Logical Connectives
• Chapter 6. Features and Predicates (only up to Sequents, page 53).