# Topics # These topics are organized in two ways: by their content, and by the week in which they were introduced. ## Topics by content ## * [[What is computation?|topics/week3_what_is_computation]] * Functional Programming * [[Introduction|topics/week1 kapulet intro]] * [[Week 1 Advanced notes|topics/week1 kapulet advanced]] * [["Rosetta Stone" page #1 for Kaupulet, Scheme, OCaml, Haskell|rosetta1]] * Offsite links for help on [[learning Scheme]], [[OCaml|learning OCaml]], and [[Haskell|learning Haskell]] * [[List Comprehensions|topics/week3 lists#comprehensions]] * Usefulness of `()` * More tips on using Scheme * Order, "static versus dynamic" * [[Order in programming languages and natural language|topics/week1 order]] * Reduction Strategies and Normal Forms in the Lambda Calculus * Usefulness of `()` * The Lambda Calculus * [[Introduction to the Lambda Calculus|topics/week2 lambda intro]] * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] * Encoding data types in the Lambda Calculus * [[Booleans|topics/week2 encodings#booleans]] * [[Tuples|topics/week2 encodings#tuples]] * [[Lists|topics/week2 encodings#lists]], v1 (as right-folds) * [[Numbers|topics/week2 encodings#numbers]], v1 ("Church's encoding") * [[Arithmetic with Church numbers|topics/week3_church_arithmetic]] * [[How to get the `tail` of v1 lists?|topics/week3 lists#tails]] * Some other list encodings * Reduction Strategies and Normal Forms * [[Combinatory Logic|topics/week3 combinatory logic]] ## Topics by week ## Week 1: * [[Order in programming languages and natural language|topics/week1 order]] This discussion considers conjunction in a language that recognized presupposition failure. * [[Introduction to functional programming|topics/week1 kapulet intro]] Basics of functional programming: `let`, `case`, pattern matching, and recursion. Definitions of factorial. * [[Advanced notes on functional programming|topics/week1 kapulet advanced]] * [[Homework for week 1|exercises/assignment1]] ([[Answers|exercises/assignment1_answers]]) Week 2: * [[Introduction to the Lambda Calculus|topics/week2 lambda intro]] * [[Advanced notes on the Lambda Calculus|topics/week2 lambda advanced]] * [[Encoding Booleans, Tuples, Lists, and Numbers|topics/week2 encodings]] * [[Homework for week 2|exercises/assignment2]] Week 3: *We will continue to develop these notes over the next few days. Expect some of the notes already posted to be expanded, and more notes to appear.* * [[Arithmetic with Church numbers|topics/week3_church_arithmetic]] * [[What is computation?|topics/week3_what_is_computation]] * [[More on Lists|topics/week3 lists]] Introduces list comprehensions, discusses how to get the `tail` of lists in the Lambda Calculus (and will discuss some other list encodings) * [[Combinatory Logic|topics/week3 combinatory logic]] * Reduction Strategies and Normal Forms * Usefulness of `()` * [[Homework for week 3|exercises/assignment3]]