Publications

• Oscar Waddell, Dipanwita Sarkar, and R. Kent Dybvig, Fixing Letrec: A Faithful Yet Efficient Implementation of Scheme's Recursive Binding Construct, Journal of Higher Order and Symbolic Computation, 2004 (to appear).
• Oscar Waddell, Dipanwita Sarkar, and R. Kent Dybvig, Robust and Effective Transformation of Letrec, 2002 Scheme Workshop, Pittsburgh, PA, October 2002.
• Oscar Waddell, Extending the Scope of Syntactic Abstraction, August 1999.
  (This is a link to my dissertation formatted (badly) for double-sided printing.)
• Oscar Waddell and R. Kent Dybvig, Extending the Scope of Syntactic Abstraction, ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, San Antonio, Texas. (POPL'99), January 1999.
• Oscar Waddell and R. Kent Dybvig, Visualizing Partial Evaluation, ACM Computing Surveys Symposium on Partial Evaluation, 24-es, September 1998.
• Oscar Waddell and J. Michael Ashley, Visualizing the Performance of Higher-Order Programs, ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering (PASTE'98), June 1998.
• Oscar Waddell and R. Kent Dybvig, Fast and Effective Procedure Inlining, Proceedings of the Fourth International Symposium on Static Analysis (SAS '97) Springer-Verlag Lecture Notes in Computer Science 1302, 35--52, September 1997. An extended version of this paper is available here as Indiana University Computer Science Department Technical Report #484. [abstract].
• Carl Bruggeman, Oscar Waddell, and R. Kent Dybvig, Representing Control in the Presence of One-Shot Continuations, ACM SIGPLAN 1996 Conference on Programming Language Design and Implementation, June 1996.
• Robert G. Burger, Oscar Waddell, and R. Kent Dybvig, Register Allocation Using Lazy Saves, Eager Restores, and Greedy Shuffling, ACM SIGPLAN 1995 Conference on Programming Language Design and Implementation, pp. 130-138, June 1995.