A tractable Scheme implementation
暂无分享,去创建一个
[1] Paul Hudak,et al. Realistic Compilation by Program Transformation. , 1989 .
[2] Guy L. Steele,et al. Common Lisp the Language , 1984 .
[3] Richard Kelsey. Tail-Recursive Stack Disciplines for an Interpreter , 1992 .
[4] Pavel Curtis,et al. A module system for scheme , 1990, LISP and Functional Programming.
[5] Tom Moher,et al. Design of the opportunistic garbage collector , 1989, OOPSLA 1989.
[6] R. Jakobson. On Language , 1990 .
[7] Paul Hudak,et al. Realistic compilation by program transformation (detailed summary) , 1989, POPL '89.
[8] Peter Lee,et al. No assembly required: compiling standard ML to C , 1992, LOPL.
[9] Microcomputer Standards Subcommittee. IEEE standard for the Scheme programming language , 1991 .
[10] Jonathan Rees,et al. Macros that work , 1991, POPL '91.
[11] David B. MacQueen. Modules for standard ML , 1984, LFP '84.
[12] William D. Clinger. The scheme 311 compiler an exercise in denotational semantics , 1984, LFP '84.
[13] Paul R. Wilson,et al. Design of the opportunistic garbage collector , 1989, OOPSLA '89.
[14] Chris Hanson,et al. Efficient stack allocation for tail-recursive languages , 1990, LISP and Functional Programming.
[15] Bruce Randall Donald,et al. Program mobile robots in Scheme , 1992, Proceedings 1992 IEEE International Conference on Robotics and Automation.
[16] Paul R. Wilson,et al. Effective “static-graph” reorganization to improve locality in garbage-collected systems , 1991, PLDI '91.
[17] D. H. Bartley,et al. Revised4 report on the algorithmic language scheme , 1991, LIPO.
[18] Peter Lee,et al. Topics in advanced language implementation , 1991 .