Equational Programming

I took this course in first year but hopefully it hasn’t changed much since then.

Contents:

• Functional programming
• Haskell
• Normal form
  • Confluence
• Booleans as lambda terms
  • Finding booleans
  • Negation
  • Conjunction (AND)
  • Disjunction (OR)
• Pair
• List
  • definition
  • head and tail
• Fixed point combinators
  • Fixed point
  • Fixed point combinator
  • examples
• Lambda terms
  • abstraction
  • application
  • terms as trees
  • parentheses
  • currying
  • free/bound variables
  • substitution
  • alpha conversion
  • beta reduction (dynamic)
• Strategies
  • Call by need
  • Call by value
  • Rightmost-outermost: not normalizing!
• Natural numbers as lambda terms
  • Church numerals
  • Definability
• Recursion
• Famous lambda calculus terms
• Weak head normal form
• Keywords