The main focus of my research is symbolic languages, a class of programming languages that includes the Lisp family (e.g. Scheme, ML), pure functional (e.g. Haskell), logic (e.g. Prolog), mathematical (e.g. APL, Mathematica, etc.), and certain object-oriented languages (e.g. Smalltalk, Java), and many more.
For my dissertation work, I developed an architecture for list-based symbolic multiprocessing and resource management algorithms (i.e. memory, processes, devices) for languages executing on that architecture. This research builds on a demand-driven computing model for lazy Lisp, suspending construction, also developed at IU by Steve Johnson, and earlier work by Daniel Friedman and David Wise.
My dissertation, entitled
is available here in HTML, PDF (2.36 MB) or gzipped Postscript (607.13 KB).
The Postscript versions of these documents are also available from the IU technical report archive as TR445.
Here is an abstract and a longer introduction.