CSC 316 Functional Programming Exam 2017

About this paper

An End-of-Semester Examination for CSC 316 Functional Programming at the University of Buea Faculty of Science, dated 01/09/2017, instructed by Dr. William Shu. Q1 covers axiomatic/denotational/operational semantics, the simply-typed lambda calculus, and type inference versus type checking. Q2 covers Church encodings, lambda-calculus simplification under call-by-name/call-by-value, combinators, SKI-combinator reduction and compilation, and a correctness proof linking a lambda term to its compiled SKI code. Q3 covers polymorphism classes, variance in subtyping, substitution, and a full unification algorithm worked on two constraint sets. Q4 covers OCaml's impurity, evaluating shadowing/closure OCaml computations, a recursive list-removal function with a custom exception, an animal union type with pattern matching, open union types, and a function-valued record type for rectangles.