Orbit: an optimizing compiler for scheme

ABSTRACT

Orbit was an optimizing compiler for T, a dialect of Scheme. Its aggressive use of CPS conversion, novel closure representations, and efficient code generation strategies made it the best compiler for a Scheme dialect at the time and for many years to come. The design of T and Orbit directly spawned six PhD theses and one Masters thesis, and influenced many other projects as well, including SML of New Jersey.

REFERENCES

• 1: Norman I. Adams. Assembling from machine descriptions. Master's thesis, Yale University, 1985.
• 2: Norman Adams , Jonathan Rees, Object-oriented programming in scheme, Proceedings of the 1988 ACM conference on LISP and functional programming, p.277-288, July 25-27, 1988, Snowbird, Utah, United States [doi>10.1145/62678.62720]
• 3: Andrew W. Appel, Compiling with continuations, Cambridge University Press, New York, NY, 1992
• 4: R. M. de Morgan, I. D. Hill, and B. A. Wichmann. Modified report on the algorithmic language ALGOL 60. Computer Journal, 19(4):364--379, 1976.
• 5: Suresh Jagannathan , Jim Philbin, A customizable substrate for concurrent languages, Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, p.55-81, June 15-19, 1992, San Francisco, California, United States
• 6: H. Abelson , R. K. Dybvig , C. T. Haynes , G. J. Rozas , N. I. Adams Iv , D. P. Friedman , E. Kohlbecker , G. L. Steele, Jr. , D. H. Bartley , R. Halstead , D. Oxley , G. J. Sussman , G. Brooks , C. Hanson , K. M. Pitman , M. Wand, Revised Report on the Algorithmic Language Scheme, Higher-Order and Symbolic Computation, v.11 n.1, p.7-105, August 1998 [doi>10.1023/A:1010051815785]
• 7: Richard Andrews Kelsey, Compilation by program transformation, 1989
• 8: David Andrew Kranz , Paul Hudak, Orbit: an optimizing compiler for scheme, 1988
• 9: D. A. Kranz , R. H. Halstead, Jr. , E. Mohr, Mul-T: a high-performance parallel Lisp, Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation, p.81-90, June 19-23, 1989, Portland, Oregon, United States
• 10: Eric Mohr, Dynamic partitioning of parallel Lisp programs, Yale University, New Haven, CT, 1992
• 11: James Francis Philbin, The design of an operating system for modern programming languages, Yale University, New Haven, CT, 1993
• 12: Jonathan Allen Rees, A security kernel based on the lambda-calculus, Massachusetts Institute of Technology, Cambridge, MA, 1995
• 13: Jonathan A. Rees , Norman I. Adams IV, T: a dialect of Lisp or LAMBDA: The ultimate software tool, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.114-122, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802142]
• 14: Olin Grigsby Shivers, Control-flow analysis of higher-order languages of taming lambda, Carnegie Mellon University, Pittsburgh, PA, 1991
• 15: Olin Shivers. History of T, 2001. Appears on Paul Graham's Lisp website, http://www.paulgraham.com/thist.html.
• 16: Guy L Steele, LAMBDA: The Ultimate Declarative, Massachusetts Institute of Technology, Cambridge, MA, 1976
• 17: Guy L Steele , Gerald J Sussman, Lambda: The Ultimate Imperative, Massachusetts Institute of Technology, Cambridge, MA, 1976
• 18: Guy L. Steele, Jr., Rabbit: A Compiler for Scheme, Massachusetts Institute of Technology, Cambridge, MA, 1978
• 19: Harold Abelson , Gerald Jay Sussman , Julie Sussman, Structure and interpretation of computer programs, MIT Press, Cambridge, MA, 1985
• 20: Rodney A. Brooks , Richard P. Gabriel , Guy L. Steele, Jr., An optimizing compiler for lexically scoped LISP, ACM SIGPLAN Notices, v.17 n.6, p.261-275, June 1982
• 21: Clinger, W., et al. The Revised Revised Report on Scheme, or An UnCommon Lisp. AI Memo 848, Massachusetts Institute of Technology, Aug., 1985.
• 22: John R. Ellis, Bulldog: a compiler for vliw architectures (parallel computing, reduced-instruction-set, trace scheduling, scientific), 1985
• 23: Fisher, J. A. Very Long Word Architectures. YALEU/DCS/RR-253, Yale University, Dec., 1982.
• 24: Daniel P. Friedman , Christopher T. Haynes, Constraining control, Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages, p.245-254, January 14-16, 1985, New Orleans, Louisiana, United States [doi>10.1145/318593.318654]
• 25: Richard P. Gabriel, Performance and evaluation of LISP systems, Massachusetts Institute of Technology, Cambridge, MA, 1985
• 26: Christopher T. Haynes , Daniel P. Friedman , Mitchell Wand, Continuations and coroutines, Proceedings of the 1984 ACM Symposium on LISP and functional programming, p.293-298, August 06-08, 1984, Austin, Texas, United States [doi>10.1145/800055.802046]
• 27: Michael L. Powell, A portable optimizing compiler for Modula-2, ACM SIGPLAN Notices, v.19 n.6, p.310-319, June 1984
• 28: Jonathan A. Rees , Norman I. Adams IV, T: a dialect of Lisp or LAMBDA: The ultimate software tool, Proceedings of the 1982 ACM symposium on LISP and functional programming, p.114-122, August 15-18, 1982, Pittsburgh, Pennsylvania, United States [doi>10.1145/800068.802142]
• 29: Rees, J. A., Adams, N. I. and Meehan, J. R. The T Manual. 4th edition, Yale University, Jan., 1984.
• 30: Rozas, W. (personal communication).
• 31: Steele, G. L. Jr. and Sussman, G. J. The Revised Report on Scheme. AI Memo 452, MIT, Jan., 1978.
• 32: Guy L. Steele, Jr., Rabbit: A Compiler for Scheme, Massachusetts Institute of Technology, Cambridge, MA, 1978
• 33: Thomas G. Szymanski, Assembling code for machines with span-dependent instructions, Communications of the ACM, v.21 n.4, p.300-308, April 1978 [doi>10.1145/359460.359474]
• 34: William Allan Wulf , Richard K. Johnsson , Charles B. Weinstock , Steven O. Hobbs , Charles M. Geschke, The Design of an Optimizing Compiler, Elsevier Science Inc., New York, NY, 1975