CSE583 Mini Term Paper Topic
These are possible topics for the mini-term papers, not organized by any
rational scheme. Remember, other topics are OK, too, if cleared by the
instructor. The major goal of the list is to give you a feel for the kinds
of things we have in mind.
- An analysis of a not-especially-common OO programming language (e.g.,
Cecil, Pizza, etc.)
- A further venture into the mathematics of type systems
- A general closer look, a focus on using them for exception handling or
another control structure, etc.
- The typed lambda calculus
- What is it and why might we care?
- A comparison of ML and Haskell
- Graph-based lamba-calculus reduction
- The Church-Rosser theorems
- An analysis of the funarg problem
- A closer look at currying
- A closer look at tail recursion
- An analysis of another functional language (such as Erlang)
- A more detailed comparison of Lisp and Scheme
||Department of Computer Science & Engineering|
University of Washington
Seattle, WA 98195-2350
(206) 543-1695 voice, (206) 543-2969 FAX