skip to main content
Orbit: an optimizing compiler for scheme
Publisher:
  • Yale University
  • Computer Science Dept. 51 Prospect St. New Haven, CT
  • United States
Order Number:AAI8917700
Pages:
132
Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Keep A, Hearn A and Dybvig R Optimizing closures in O(0) time Proceedings of the 2012 Annual Workshop on Scheme and Functional Programming, (30-35)
  2. ACM
    Midtgaard J (2012). Control-flow analysis of functional programs, ACM Computing Surveys, 44:3, (1-33), Online publication date: 1-Jun-2012.
  3. ACM
    Vardoulakis D and Shivers O Ordering multiple continuations on the stack Proceedings of the 20th ACM SIGPLAN workshop on Partial evaluation and program manipulation, (13-22)
  4. ACM
    Vardoulakis D and Shivers O Pushdown flow analysis of first-class control Proceedings of the 16th ACM SIGPLAN international conference on Functional programming, (69-80)
  5. ACM
    Vardoulakis D and Shivers O (2011). Pushdown flow analysis of first-class control, ACM SIGPLAN Notices, 46:9, (69-80), Online publication date: 18-Sep-2011.
  6. Danvy O, Shan C and Zerny I J Is for JavaScript Proceedings of the IFIP TC 2 Working Conference on Domain-Specific Languages, (1-19)
  7. ACM
    Shivers O and Might M Continuations and transducer composition Proceedings of the 27th ACM SIGPLAN Conference on Programming Language Design and Implementation, (295-307)
  8. ACM
    Shivers O and Might M (2006). Continuations and transducer composition, ACM SIGPLAN Notices, 41:6, (295-307), Online publication date: 11-Jun-2006.
  9. Shivers O and Fisher D (2006). Multi-return function call, Journal of Functional Programming, 16:4-5, (547-582), Online publication date: 1-Jul-2006.
  10. Waddell O, Sarkar D and Dybvig R (2005). Fixing Letrec, Higher-Order and Symbolic Computation, 18:3-4, (299-326), Online publication date: 1-Dec-2005.
  11. ACM
    Shivers O (2004). Higher-order control-flow analysis in retrospect, ACM SIGPLAN Notices, 39:4, (257-269), Online publication date: 1-Apr-2004.
  12. ACM
    Kranz D, Kelsey R, Rees J, Hudak P, Philbin J and Adams N (2004). Orbit, ACM SIGPLAN Notices, 39:4, (175-191), Online publication date: 1-Apr-2004.
  13. Danvy O A new one-pass transformation into monadic normal form Proceedings of the 12th international conference on Compiler construction, (77-89)
  14. Clinger W, Hartheimer A and Ost E (1999). Implementation Strategies for First-Class Continuations, Higher-Order and Symbolic Computation, 12:1, (7-45), Online publication date: 1-Apr-1999.
  15. ACM
    Grove D, DeFouw G, Dean J and Chambers C (1997). Call graph construction in object-oriented languages, ACM SIGPLAN Notices, 32:10, (108-124), Online publication date: 9-Oct-1997.
  16. ACM
    Grove D, DeFouw G, Dean J and Chambers C Call graph construction in object-oriented languages Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications, (108-124)
  17. ACM
    Serrano M and Feeley M (1996). Storage use analysis and its applications, ACM SIGPLAN Notices, 31:6, (50-61), Online publication date: 15-Jun-1996.
  18. ACM
    Peyton Jones S, Partain W and Santos A (1996). Let-floating, ACM SIGPLAN Notices, 31:6, (1-12), Online publication date: 15-Jun-1996.
  19. ACM
    Serrano M and Feeley M Storage use analysis and its applications Proceedings of the first ACM SIGPLAN international conference on Functional programming, (50-61)
  20. ACM
    Peyton Jones S, Partain W and Santos A Let-floating Proceedings of the first ACM SIGPLAN international conference on Functional programming, (1-12)
  21. ACM
    Serrano M Control flow analysis Proceedings of the 1995 ACM symposium on Applied computing, (118-122)
  22. ACM
    Shao Z and Appel A (1995). A type-based compiler for standard ML, ACM SIGPLAN Notices, 30:6, (116-129), Online publication date: 1-Jun-1995.
  23. ACM
    Debray S Abstract interpretation and low-level code optimization Proceedings of the 1995 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation, (111-121)
  24. ACM
    Shao Z and Appel A A type-based compiler for standard ML Proceedings of the ACM SIGPLAN 1995 conference on Programming language design and implementation, (116-129)
  25. ACM
    Reinhold M (1994). Cache performance of garbage-collected programs, ACM SIGPLAN Notices, 29:6, (206-217), Online publication date: 1-Jun-1994.
  26. ACM
    Shao Z and Appel A (1994). Space-efficient closure representations, ACM SIGPLAN Lisp Pointers, VII:3, (150-161), Online publication date: 1-Jul-1994.
  27. ACM
    Shao Z and Appel A Space-efficient closure representations Proceedings of the 1994 ACM conference on LISP and functional programming, (150-161)
  28. ACM
    Reinhold M Cache performance of garbage-collected programs Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation, (206-217)
  29. ACM
    Park Y and Goldberg B (1992). Escape analysis on lists, ACM SIGPLAN Notices, 27:7, (116-127), Online publication date: 1-Jul-1992.
  30. ACM
    Park Y and Goldberg B Escape analysis on lists Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation, (116-127)
  31. ACM
    Baker H (1992). CONS should not CONS its arguments, or, a lazy alloc is a smart alloc, ACM SIGPLAN Notices, 27:3, (24-34), Online publication date: 1-Mar-1992.
  32. ACM
    Abelson H, Dybvig R, Haynes C, Rozas G, Adams N, Friedman D, Kohlbecker E, Steele G, Bartley D, Halstead R, Oxley D, Sussman G, Brooks G, Hanson C, Pitman K, Wand M, Clinger W and Rees J (1991). Revised4 report on the algorithmic language scheme, ACM SIGPLAN Lisp Pointers, IV:3, (1-55), Online publication date: 1-Jul-1991.
  33. ACM
    Wilson P (1991). Some issues and strategies in heap management and memory hierarchies, ACM SIGPLAN Notices, 26:3, (45-52), Online publication date: 2-Jan-1991.
  34. ACM
    Stansifer R (1990). Imperative versus functional, ACM SIGPLAN Notices, 25:4, (69-72), Online publication date: 1-Apr-1990.
  35. ACM
    Mohr E, Kranz D and Halstead R Lazy task creation: a technique for increasing the granularity of parallel programs Proceedings of the 1990 ACM conference on LISP and functional programming, (185-197)
  36. ACM
    Appel A and Jim T Continuation-passing, closure-passing style Proceedings of the 16th ACM SIGPLAN-SIGACT symposium on Principles of programming languages, (293-302)
  37. ACM
    Kranz D, Halstead R and Mohr E (1989). Mul-T: a high-performance parallel Lisp, ACM SIGPLAN Notices, 24:7, (81-90), Online publication date: 1-Jul-1989.
  38. ACM
    Kranz D, Halstead R and Mohr E Mul-T: a high-performance parallel Lisp Proceedings of the ACM SIGPLAN 1989 conference on Programming language design and implementation, (81-90)
  39. ACM
    Vegdahl S and Pleban U The runtime environment for Scheme, a Scheme implementation on the 88000 Proceedings of the third international conference on Architectural support for programming languages and operating systems, (172-182)
  40. ACM
    Vegdahl S and Pleban U (1989). The runtime environment for Scheme, a Scheme implementation on the 88000, ACM SIGARCH Computer Architecture News, 17:2, (172-182), Online publication date: 1-Apr-1989.
Contributors
  • Yale University
  • Yale University

Recommendations