Thurday, 5:15 PM in McConomy.
Take two quantized disjunctive/conjunctive equiprobable scalar datastructures, add a dash of multidimensional polymorphism, a handful of redefined operators, and a pinch of breadth-first optree evaluation. Simmer gently in the Principle of Least Effort. Decant into a grandiosely named module. Now serve vector operations (prime generation, list membership, list extrema, etc.) without the need for loops or recursion.
Lecture notes will be avilable under separate cover after the talk.