What the heck? In this course, we'll use a Scheme-ish language to program Android phones to act like handbells, and play songs with them. You won't write a traditional smartphone program, but we'll talk a little about smartphone programming concepts and challenges, and you'll get to use literally cutting-edge research code. http://www.youtube.com/watch?v=WMYLJUKMPbA

We will discuss some concepts common to the core of all programming languages, and learn how to implement simple Scheme-like languages. Topics covered will include modeling syntax, evaluation in a functional language, substitution versus environments, and first-class functions. The class will be based in part on /Programming Languages: Application and Interpretation/ by Krishnamurthi (available online.)

This is a continuation of C3099. We will discuss more advanced topics in programming language implementations: laziness, recursions, state, and continuation-passing-style and some of its uses.

From almost all high-level math classes to the explanations of simple arithmetic tricks, math is all about proofs. But what does it mean to prove something? What is a proof, anyway? In this class, we'll take a survey of metamathematics-- the study of formal systems and reasoning. We'll discuss topics like deductions, completeness, and consistency, some history, and some of metamath's best results.

Ever hear of Haskell? Unlike most programming language, Haskell tries to avoid running code. Unlike most programming languages, Haskell is very high-level. Unlike most programming languages, Haskell can check your program for type errors without being wordy or restrictive. And yet, Haskell is one of the fastest programming languages in use. If you want to learn Haskell, this class is for you.

Come for an in-depth discussion on the limits of any sort of formal system, from math to computers. We'll cover ...

You may think "number" is a simple concept. In reality, mathematicians deal with many different kinds of numbers. We'll start ...