CMPT 383 Lecture Notes

  1. Course Introduction [“Course Introduction” slides]
    1. This Course [This Course slides]
    2. Overall Goals [Overall Goals slides]
    3. Topics (1) [Topics (1) slides]
    4. Grades [Grades slides]
    5. Weekly Exercises [Weekly Exercises slides]
    6. Assignments [Assignments slides]
    7. Exams [Exams slides]
    8. References [References slides]
    9. Expectations [Expectations slides]
    10. What is a program? [What is a program? slides]
    11. Imperative Programming [Imperative Programming slides]
    12. Declarative Programming [Declarative Programming slides]
  2. Functional Programming & Haskell [“Functional Programming & Haskell” slides]
    1. Haskell [Haskell slides]
    2. Haskell Basics [Haskell Basics slides]
    3. Haskell Functions [Haskell Functions slides]
    4. Pattern Matching [Pattern Matching slides]
    5. Conditionals [Conditionals slides]
    6. Repetition [Repetition slides]
    7. List Comprehensions [List Comprehensions slides]
    8. Let and Where [Let and Where slides]
    9. Recursion [Recursion slides]
    10. Isn't Recursion Slow? [Isn't Recursion Slow? slides]
    11. Tail Recursion [Tail Recursion slides]
    12. Creating Tail Recursion [Creating Tail Recursion slides]
    13. Aside: C and Tail Recursion [Aside: C and Tail Recursion slides]
  3. Haskell: Types & Functions [“Haskell: Types & Functions” slides]
    1. Functions and Operators [Functions and Operators slides]
    2. Parts of Lists [Parts of Lists slides]
    3. More List Processing [More List Processing slides]
    4. Haskell Types [Haskell Types slides]
    5. Type Classes [Type Classes slides]
    6. Partially-Applied Functions [Partially-Applied Functions slides]
    7. Curried Functions [Curried Functions slides]
    8. Manipulating Functions [Manipulating Functions slides]
    9. Lambda Expressions [Lambda Expressions slides]
  4. Haskell: Expression Evaluation [“Haskell: Expression Evaluation” slides]
    1. Assignment 1 [Assignment 1 slides]
    2. Lazy Evaluation [Lazy Evaluation slides]
    3. Controlling Laziness [Controlling Laziness slides]
    4. Function Application [Function Application slides]
    5. Pure Functions [Pure Functions slides]
    6. Concurrent Programming [Concurrent Programming slides]
    7. Monads [Monads slides]
    8. Monad: Maybe [Monad: Maybe slides]
    9. Monad: Random Numbers [Monad: Random Numbers slides]
    10. Records [Records slides]
    11. Haskell Tips [Haskell Tips slides]
    12. Functional Programming Context [Functional Programming Context slides]
    13. Functional + Imperative [Functional + Imperative slides]
  5. What Do Processors Do? [“What Do Processors Do?” slides]
    1. What Does A Programming Language Do? [What Does A Programming Language Do? slides]
    2. What Does A Compiler Do? [What Does A Compiler Do? slides]
    3. What Do Processors Do? [What Do Processors Do? slides]
    4. Pipelines [Pipelines slides]
    5. SIMD [SIMD slides]
    6. Multiple Cores [Multiple Cores slides]
    7. Memory Cache [Memory Cache slides]
    8. Summary [Summary slides]
  6. Language Design [“Language Design” slides]
    1. Language Choice [Language Choice slides]
    2. Language Paradigm [Language Paradigm slides]
    3. Code Organization [Code Organization slides]
    4. Compilers & Interpreters [Compilers & Interpreters slides]
    5. Virtual Machines [Virtual Machines slides]
    6. Compiler Optimization [Compiler Optimization slides]
    7. Just-In-Time Compilation [Just-In-Time Compilation slides]
    8. Language Implementations [Language Implementations slides]
    9. A Silly Benchmark [A Silly Benchmark slides]
  7. Languages: Types [“Languages: Types” slides]
    1. Static/Dynamic Typing [Static/Dynamic Typing slides]
    2. Gradual Typing [Gradual Typing slides]
    3. Static/Dynamic Binding [Static/Dynamic Binding slides]
    4. Generics & Polymorphism [Generics & Polymorphism slides]
    5. Type Inference [Type Inference slides]
    6. Type Checking [Type Checking slides]
    7. Mutable/Immutable Data [Mutable/Immutable Data slides]
  8. Languages: Memory [“Languages: Memory” slides]
    1. Managing Memory [Managing Memory slides]
    2. Manual Memory Mgmt. [Manual Memory Mgmt. slides]
    3. Garbage Collection [Garbage Collection slides]
    4. Tracking Ownership [Tracking Ownership slides]
  9. Languages: Expressing Logic [“Languages: Expressing Logic” slides]
    1. Conditionals [Conditionals slides]
    2. Iteration [Iteration slides]
    3. Algorithms [Algorithms slides]
    4. Summary [Summary slides]
    5. Breaking News! [Breaking News! slides]
  10. Languages & Concurrency [“Languages & Concurrency” slides]
    1. Concurrent Programming [Concurrent Programming slides]
    2. Threads & Processes [Threads & Processes slides]
    3. Kernel/User Threads [Kernel/User Threads slides]
    4. Thread Communication [Thread Communication slides]
    5. Language Concurrency [Language Concurrency slides]
    6. Async Programming [Async Programming slides]
    7. Concurrency Tools [Concurrency Tools slides]
  11. Languages: Functions [“Languages: Functions” slides]
    1. First-Class Functions [First-Class Functions slides]
    2. Closures [Closures slides]
    3. Callbacks [Callbacks slides]
    4. Coroutines [Coroutines slides]
    5. Undefined Behaviour [Undefined Behaviour slides]
  12. Language Productivity [“Language Productivity” slides]
    1. Programmer Efficiency [Programmer Efficiency slides]
    2. Library Availability [Library Availability slides]
    3. High- vs Low-Level [High- vs Low-Level slides]
    4. Programming Paradigm [Programming Paradigm slides]
    5. Language Features [Language Features slides]
  13. Languages: Mixing Languages [“Languages: Mixing Languages” slides]
    1. Foreign Function Calls [Foreign Function Calls slides]
    2. Remote Procedure Calls [Remote Procedure Calls slides]
    3. Summary [Summary slides]
  14. Rust & “Safe” Programming [“Rust & “Safe” Programming” slides]
    1. Ownership [Ownership slides]
    2. Rust [Rust slides]
    3. Variables & Types [Variables & Types slides]
    4. Compound Types [Compound Types slides]
    5. Mutability [Mutability slides]
    6. Control Flow [Control Flow slides]
    7. More Expressions [More Expressions slides]
    8. Functions [Functions slides]
    9. Vectors [Vectors slides]
    10. References [References slides]
    11. Borrowing [Borrowing slides]
    12. Ownership [Ownership slides]
    13. Ownership Rules [Ownership Rules slides]
    14. Moving and Copying [Moving and Copying slides]
    15. Cloning [Cloning slides]
    16. Structs [Structs slides]
    17. Traits [Traits slides]
    18. Generic Types [Generic Types slides]
    19. Core Traits [Core Traits slides]
    20. Errors [Errors slides]
  15. Rust: Concurrency [“Rust: Concurrency” slides]
    1. Threads [Threads slides]
    2. Messages [Messages slides]
    3. More Concurrency Tools [More Concurrency Tools slides]
  16. Rust: Memory Management [“Rust: Memory Management” slides]
    1. Static Binding [Static Binding slides]
    2. Data Structures [Data Structures slides]
    3. The Heap and Box [The Heap and Box slides]
    4. More Smart Pointers [More Smart Pointers slides]
    5. Shared Mutable State [Shared Mutable State slides]
    6. Dynamic Values [Dynamic Values slides]
  17. Rust: Epilogue [“Rust: Epilogue” slides]
    1. The Other Rusts [The Other Rusts slides]
    2. What Is Rust? [What Is Rust? slides]
  18. Logic Programming & Prolog [“Logic Programming & Prolog” slides]
    1. Predicates [Predicates slides]
    2. Rules [Rules slides]
    3. Searching [Searching slides]
    4. Search Limits [Search Limits slides]
    5. Conclusion [Conclusion slides]
  19. Languages Matter [“Languages Matter” slides]
    1. Domain-Specific Languages [Domain-Specific Languages slides]
    2. Domain-Specific Libraries [Domain-Specific Libraries slides]
    3. Languages Don't Matter [Languages Don't Matter slides]
    4. Conclusion [Conclusion slides]

Course home page; lecture audio recordings.

Schedule, Summer 2025

Week Deliverables (*) Lecture Hour Lecture Date First Slide
1 1, 2 May 12 Intro
3 May 14 Pattern Matching
2 Exer 1 4, 5 May 19 Victoria Day holiday 👑
6 May 21 List Comprehensions
3 Exer 2 7, 8 May 26 Creating Tail Recursion
9 May 28 Type Classes
4 Exer 3 10, 11 Jun 2 Lambda Expressions
12 Jun 4 Concurrent Programming
5 Exer 4 13, 14 Jun 9 Monads
15 Jun 11 Processors
6 Exer 5 16, 17 Jun 16 Memory Cache
18 Jun 18 Language Implementations
7 Assign 1 19, 20 Jun 23 Static/​Dynamic Binding
21 Jun 25 Logic: Iteration
8 Exer 6, Midterm 22, 23 Jun 30 no lecture
24 Jul 2 Midterm Exam
9 Assign 2 25, 26 Jul 7 Async Progr
27 Jul 9 Mixing Languages
10 Exer 7 28, 29 Jul 14 Mutability
30 Jul 16 Structs
11 Exer 8 31, 32 Jul 21 Generic Types
33 Jul 23 More Concurrency Tools
12 Exer 9 34, 35 Jul 28 More Smart Pointers
36 Jul 30 Prolog: Searching
13 Exer 10, Assign 3 37, 38 Aug 4 BC Day holiday 🌲
39 Aug 6 Review lecture
14+ Final Exam —

* Check CourSys for the actual due dates and times.

Exam instruction slide.