CPSC-370 Lecture Planning — Fall 2017
This page is an attempt to engage in CPSC 370 lecture Planning.
- Anonymous functions and λ-expressions
-
Defining functions in Scheme
(Racket)
- Syntactic sugar; First class things
- Pairs and lists in Scheme
-
- Programming practice: Scheme
- Relations
- Functions and Partial functions
- Multi-argument functions
- Anonymous functions
- Counting functions
- Currying
Lecture 7 (Mon Sep 18)
- Programming practice: Scheme
- Collatz sequences
- the drop function
Lecture 10 (Mon Sep 25)
- Programming constructs in Haskell
- Local bindings in Scheme
-
Lecture 12 (Mon Oct 02)
- The
Maybe
type.
- Local variables.
- Various forms of
let
in Scheme.
Lecture 13 (Mon Oct 02)
- Static versus dynamic typing
- Hindley-Milner typing
-
Lecture 14 (Fri Oct 06)
-
- Strict versus lazy languages
- Midterm review
Thanksgiving Monday (Mon Oct 09)
blah blah blah
Midterm I (Wed Oct 11)
Lecture 17 (Fri Oct 13)
- Midterm 1 return and review
Lecture 18 (Mon Oct 16)
- Naïve laziness
- thunks
- Using laziness in Java
Lecture 19 (Mon Oct 16)
- Using the IO monad
- Solving the demipriest problem
Lecture 20 (Fri Oct 20)
- Classes and instances in Haskell
Lecture 21 (Mon Oct 23)
- Types and datatypes in Haskell
- Environments
- Static versus dynamic binding
- Racket parameters
Lecture 22 (Mon Oct 23)
- tail recursion
- accumulators
-
University Closure (Mon Nov 13)
blah blah blah
Midterm II (Wed Nov 15)
blah blah blah