CPSC 370 — Functional and Logic Programming — Fall 2015

Important information may be posted here from time to time.

Students in this course who, because of a disability, may have a need for special academic accommodations should discuss this with the instructor, or contact the Access Resource Centre located in the Teaching & Learning Building in Room 10-1048.

The final will be 3 hours long on Wednesday December 9 at 18:00 in Room 5-155.

See the homework link on the menu-bar.

• An introduction to functional programming. Static and dynamic typing. Strict and non-strict evaluation. Pure versus impure functional programming.
• Some common functional programning languages.
• Functions and partial functions.
• Cartesian products. Disjoint unions. Currying.

Haskell.

• Builtin types and literals. Tuples. Lists.
• Declarations. Function declarations and function values.
• Datatypes.
• Exploiting laziness. Downsides to laziness.
• Recursion, tail recursion, and accumulator arguments.
• Monadic programming.

Scheme

• Space and time complexity for functional programs and data structures.

Prolog.

• An introduction to logic programming.
• Facts. Rules. Goals. Variables. Conjunctions. Horn Clauses.
• The Unification algorithm.
• Accumulator arguments.
• Difference lists.
• Cuts. Negation.
• Arithmetic.
• Debugging.

1. I reserve the right to change the weight of any portion of this marking scheme. If changes are made, your grade will be calculated using the original weighting and the new weighting, and you will be given the higher of the two.