oz@nexus.YorkU.CA (Ozan Yigit) (09/20/90)
1. J. Reynolds, Definitional Interpreters for Higher Order
Programming Languages, ACM Conference Proceedings,
1972, 717-740.
2. G. J. Sussman and G. L. S. Jr., Scheme: an Interpreter
for Extended Lambda Calculus, MIT AI Memo 349,
Massachusetts Institute of Technology, Cambridge,
Mass., December 1975.
3. G. L. S. Jr. and G. J. Sussman, Lambda, the Ultimate
Imperative, MIT AI Memo 353, Massachusetts Institute of
Technology, Cambridge, Mass., March 1976.
4. G. L. S. Jr., Lambda, the Ultimate Declarative, MIT AI
Memo 379, Massachusetts Institute of Technology,
Cambridge, Mass., November 1976.
5. G. L. S. Jr., Debunking the ``Expensive Procedure
Call'' Myth, or Procedure Call Implementations
Considered Harmful, or LAMBDA, the Ultimate GOTO, ACM
Conference Proceedings, 1977, 153-162.
6. G. L. S. Jr., Macaroni is Better than Spaghetti,
Proceedings of the Symposium on Artificial Intelligence
and Programming Languages, August 1977, 60-66. Special
joint issue of SIGPLAN Notices Notices 12(8) and SIGART
Newsletter 64.
7. M. Wand, Continuation-Based Program Transformation
Strategies, Journal of the ACM 27, 1 (1978), 174-180.
8. M. Wand and D. P. Friedman, Compiling lambda
expressions using continuations and factorizations,
Journal of Computer Languages 3(1978), 241-263.
9. G. L. S. Jr. and G. J. Sussman, The Revised Report on
Scheme, a Dialect of Lisp, MIT AI Memo 452,
Massachusetts Institute of Technology, Cambridge,
Mass., January 1978.
10. G. L. S. Jr., Rabbit: a Compiler for Scheme, MIT AI
Memo 474, Massachusetts Institute of Technology,
Cambridge, Mass., May 1978.
11. G. L. S. Jr. and G. J. Sussman, The Art of the
Interpreter, or the Modularity Complex (parts zero,
one, and two), MIT AI Memo 453, Massachusetts Institute
of Technology, Cambridge, Mass., May 1978.
12. G. L. S. Jr. and G. J. Sussman, Design of LISP-Based
Processors or, SCHEME: A Dielectric LISP or, Finite
Memories Considered Harmful or, LAMBDA: The Ultimate
Opcode", MIT-AI Memo 514, Massachusetts Institute of
Technology, Cambridge, Mass., 1979.
13. U. F. Pleban, The Standard Semantics of a Subset of
SCHEME, a Dialect of LISP, Computer Science Technical
Report Tech. Rep.-79-3, University of Kansas, Lawrence,
Kansas, July 1979.
14. G. L. S. Jr., Compiler Optimization Based on Viewing
LAMBDA as RENAME + GOTO, in AI: An MIT Perspective, P.
H. Winston and R. H. Brown (ed.), MIT Press, Cambridge,
Mass., 1980.
15. G. L. S. Jr. and G. J. Sussman, The Dream of a
Lifetime: a Lazy Variable Extent Mechanism, Conference
Record of the 1980 Lisp Conference, 1980, 163-172.
16. D. McDermott, An Efficient Environment Allocation
Scheme in an Interpreter for a Lexically-Scoped Lisp,
Conference Record of the 1980 Lisp Conference, 1980,
154-162. Proceedings reprinted by ACM.
17. S. S. Muchnick and U. F. Pleban, A Semantic Comparison
of Lisp and Scheme, Conference Record of the 1980 Lisp
Conference, 1980, 56-65.
18. U. F. Pleban, A Denotational Approach to Flow Analysis
and Optimization of SCHEME, A Dialect of LISP, Ph.D.
Dissertation, University of Kansas, Lawrence, Kansas,
1980.
19. M. Wand, Continuation-Based Multiprocessing, Conference
Record of the 1980 Lisp Conference, 1980, 19-28.
20. M. Wand, SCHEME Version 3.1 Reference Manual, Computer
Science Technical Report 93, Indiana University,
Bloomington, Indiana, June 1980.
21. G. L. S. Jr. and G. J. Sussman, Design of a Lisp-based
Processor, Comm. ACM 23, 11 (November 1980), 628-645.
22. R. A. Dwyer and R. K. Dybvig, A SCHEME for Distributed
Processes, Computer Science Department Technical Report
#107, Indiana University, Bloomington, Indiana, April
1981.
23. G. J. Sussman, J. Holloway, G. L. S. Jr. and A. Bell,
Scheme-79 - Lisp on a Chip, IEEE Computer 14, 7 (July
1981), 10-21, IEEE.
24. J. Batali, E. Goodhue, C. Hanson, H. Shrobe, R. M.
Stallman and G. J. Sussman, The Scheme-81 Architecture
- System and Chip, Proceedings, Conference on Advanced
Research in VLSI, Artech House, Dedham MA., 1982, 69-
77.
25. J. A. Rees and N. I. Adams, T: A Dialect of Lisp or,
LAMBDA: The Ultimate Software Tool, Conference Record
of the 1982 ACM Symposium on Lisp and Functional
Programming, 1982, 114-122.
26. G. J. Sussman, LISP, Programming and Implementation, in
Functional Programming and its Applications, D. H.
Turner (ed.), Cambridge University Press, London, 1982.
27. R. K. Dybvig, C-Scheme, Computer Science Department
Technical Report #149 (MS Thesis), Indiana University,
Bloomington, Indiana, 1983.
28. P. H. Chen, W. Y. Chi, E. M. Ost, L. D. Sabbagh and G.
Springer, Scheme Graphics Reference Manual, Computer
Science Technical Report No. 145, Indiana University ,
Bloomington, Indiana, August 1983.
29. P. H. Chen and D. P. Friedman, Prototyping data flow by
translation into Scheme, Computer Science Technical
Report #147, Indiana University, Bloomington, Indiana,
August 1983.
30. C. Fessenden, W. Clinger, D. P. Friedman and C. T.
Haynes, Scheme 311 version 4 Reference Manual, Computer
Science Technical Report 137, Indiana University,
Bloomington, Indiana, February 1983. Superseded by
Computer Science Technical Report 153, 1985.
31. W. Clinger, The Scheme 311 compiler: An Exercise in
Denotational Semantics, Conference Record of the 1984
ACM Symposium on Lisp and Functional Programming, 1984,
356-364.
32. D. P. Friedman, C. T. Haynes and E. E. Kohlbecker,
Programming with Continuations, in Program
Transformation and Programming Environments, P. Pepper
(ed.), Springer-Verlag, 1984, 263-274.
33. C. T. Haynes and D. P. Friedman, Engines Build Process
Abstractions, Conference Record of the 1984 ACM
Symposium on Lisp and Functional Programming, Austin,
TX., 1984, 18-24.
34. C. T. Haynes, D. P. Friedman and M. Wand, Continuations
and Coroutines, Conference Record of the 1984 ACM
Symposium on Lisp and Functional Programming, Austin,
TX., 1984, 293-298.
35. D. P. Friedman and M. Wand, Reification: reflection
without metaphysics, Conference Record of the 1984 ACM
Symposium on LISP and Functional Programming, Austin,
TX., August 1984, 348-355.
36. J. A. Rees, N. I. Adams and J. R. Meehan, The T manual,
fourth edition, Yale University Computer Science
Department, January 1984.
37. G. J. Rozas, Liar, an Algol-like Compiler for Scheme,
S. B. Thesis, Department of Electrical Engineering and
Computer Science, Massachusetts Institute of
Technology, January 1984.
38. R. Schooler and J. W. Stamos, Proposal For a Small
Scheme Implementation, MIT LCS Memo TM-267,
Massachusetts Institute of Technology, Cambridge,
Mass., October 1984.
39. MIT Scheme Manual, Seventh Edition, Department of
Electrical Engineering and Computer Science,
Massachusetts Institute of Technology, Cambridge,
Mass., September 1984.
40. MacScheme Reference Manual, Semantic Microsystems,
Sausalito, California, 1985.
41. H. Abelson, G. J. Sussman and J. Sussman, Structure and
Interpretation of Computer Programs, MIT Press,
Cambridge, Mass., 1985.
42. W. Clinger, D. P. Friedman and M. Wand, A Scheme for a
Higher-Level Semantic Algebra, in Algebraic Methods in
Semantics, J. R. M. Nivat (ed.), Cambridge University
Press, London, 1985, 237-250.
43. A. Srivastava, D. Oxley and A. Srivastava, An (other)
Integration of Logic and Functional Programming,
Proceedings of the Symposium on Logic Programming,
1985, 254-260.
44. The Revised Revised Report on Scheme, or An Uncommon
Lisp, MIT AI Memo 848, Massachusetts Institute of
Technology, Cambridge, Mass., August 1985. Also
published as Computer Science Department Technical
Report 174, Indiana University, June 1985.
45. D. P. Friedman and C. T. Haynes, Constraining Control,
Proceedings of the Twelfth Annual Symposium on
Principles of Programming Languages, New Orleans, LA.,
January 1985, 245-254.
46. D. P. Friedman, C. T. Haynes, E. E. Kohlbecker and M.
Wand, Scheme 84 Interim Reference Manual, Computer
Science Technical Report 153, Indiana University,
Bloomington, Indiana, January 1985.
47. P. Chen and L. D. Sabbagh, Scheme as an Interactive
Graphics Programming Environment, Computer Science
Technical Report No. 166, Indiana University,
Bloomington, Indiana, March 1985.
48. R. K. Dybvig and B. T. Smith, Chez Scheme Reference
Manual Version 1.0, Cadence Research Systems,
Bloomington, Indiana, May 1985.
49. TI Scheme Language Reference Manual, Texas Instruments,
Inc., November 1985. Preliminary version 1.0.
50. M. A. Eisenberg, Bochser: An Integrated Scheme
Programming System, MIT Computer Science Technical
Report 349, Massachusetts Institute of Technology,
Cambridge, Mass., October 1985.
51. M. Felleisen, Transliterating Prolog into Scheme,
Computer Science Technical Report #182, Indiana
University, Bloomington, Indiana, October 1985.
52. D. H. Bartley and J. C. Jensen, The Implementation of
PC Scheme, Proceedings of the 1986 ACM Conference on
Lisp and Functional Programming, 1986, 86-93.
53. R. K. Dybvig, D. P. Friedman and C. T. Haynes,
Expansion-Passing style: Beyond Conventional Macros,
Conference Record of the 1986 ACM Conference on Lisp
and Functional Programming, 1986, 143-150.
54. M. Feeley and G. LaPalme, Closure Generation based on
viewing LAMBDA as EPSILON plus COMPILE, Submitted for
Publication, 1986.
55. M. Felleisen and D. P. Friedman, A Closer Look At
Export and Import Statements, Journal of Computer
Languages 11, 1 (1986), 29-37, Pergamon Press.
56. D. P. Friedman and M. Felleisen, The Little LISPer:
Second Edition, Science Research Associates, Inc., Palo
Alto, California, 1986.
57. C. T. Haynes, D. P. Friedman and M. Wand, Obtaining
Coroutines With Continuations, Journal of Computer
Languages 11, 3/4 (1986), 143-153, Pergamon Press.
58. M. Wand, Finding the Source of Type Errors, Conference
Record of the Thirteenth Annual Symposium on Principles
of Programming Languages, St. Peterburg, Fla., 1986,
38-43.
59. M. Wand, From Interpreter to Compiler: A
Representational Derivation, in Programs as Data
Objects, Springer-Verlag Lecture Notes, 1986.
60. M. Felleisen and D. P. Friedman, Control operators, the
SECD-machine, and the lambda-calculus, 3rd Working
Conference on the Formal Description of Programming
Concepts, Ebberup, Denmark, August 1986, 193-219.
61. E. E. Kohlbecker, Syntactic Extensions in the
Programming Language Lisp, Computer Science Technical
Report #199 (Ph.D. Dissertation), Indiana University,
Bloomington, Indiana, August 1986.
62. E. E. Kohlbecker, D. P. Friedman, M. Felleisen and B.
Duba, Hygienic macro expansion, Symposium on LISP and
Functional Programming, August 1986, 151-161. To
appear in Lisp and Symbolic Computation.
63. M. Wand, The mystery of the tower revealed: a non-
reflective description of the reflective tower,
Proceedings of the 1986 ACM Symposium on LISP and
Functional Programming, August 1986, 298-307.
64. J. A. Rees and W. Clinger, eds., Revised^3 Report on
the Algorithmic Language Scheme, ACM Sigplan Notices
21, 12 (December 1986), .
65. C. T. Haynes, Logic Continuations, Proceedings of the
Third International Conference on Logic Programming,
July 1986, 671-685.
66. M. Felleisen, D. P. Friedman, E. E. Kohlbecker and B.
Duba, Reasoning with Continuations, Proceedings of the
Symposium on Logic in Computer Science, Washington DC,
June 1986, 131-141.
67. D. Kranz, R. Kelsey, J. A. Rees, P. Hudak, J. Philbin
and N. I. Adams, Orbit: An Optimizing Compiler for
Scheme, Proceedings of the SIGPLAN Notices '86
Symposium on Compiler Construction, June 1986, 219-233.
Published as SIGPLAN Notices Notices 21(7), July 1986.
68. M. Feeley, Deux Approches a' L'implantation du Language
Scheme, M.Sc. Thesis, De'partement d'Informatique et de
Recherche Ope'rationelle, University of Montreal, May
1986. " . ie !""" .nr t[ 1
69. K. J. Lang and B. A. Pearlmutter, " Oaklisp: an
Object-Oriented Scheme with First Class Types",,
September 1986.
70. W. Clinger, The Scheme of things: Streams versus
Generators, Technical Report, Tektronix, Inc., 1987.
71. R. K. Dybvig, The Scheme Programming Language,
Prentice-Hall, Inc., Englewood Cliffs, New Jersey,
1987.
72. M. Feeley and G. LaPalme, Using Closures for Code
Generation, Journal of Computer Languages 12, 1 (1987),
47-66, Pergamon Press.
73. M. Felleisen, Reflections on Landin's J-Operator: A
Partly Historical Note, Journal of Computer Languages
12, 3/4 (1987), 197-207, Pergamon Press.
74. M. Felleisen and D. P. Friedman, A Reduction Semantics
for Imperative Higher-Order Languages, Parallel
Architectures and Languages Europe 259(1987), 206-223,
Springer-Verlag.
75. M. Felleisen, D. P. Friedman, E. E. Kohlbecker and B.
Duba, A syntactic theory of sequential control,
Theoretical Computer Science 52(1987), 205-237.
76. D. P. Friedman and M. Felleisen, The Little LISPer, MIT
Press, 1987. Trade Edition.
77. C. T. Haynes and D. P. Friedman, Abstracting Timed
Preemption with Engines, Journal of Computer Languages
12, 2 (1987), 109-121, Pergamon Press.
78. S. Slade, in The T programming Language, Prentice-Hall
Inc., Englewood Cliffs, N.J., 1987.
79. R. K. Dybvig, Three Implementation Models for Scheme,
Department of Computer Science Technical Report #87-011
(Ph.D. Dissertation), University of North Carolina at
Chapel Hill, Chapel Hill, North Carolina, April 1987.
80. M. Felleisen, The Calculi of lambda-v-cs conversion: a
syntactic theory of control and state in imperative
higher-order programming languages, Computer Science
Technical Report #226. (Ph.D. Dissertation), Indiana
University, Bloomington, Indiana, August 1987.
81. J. S. Miller, A Parallel Processing System Based on MIT
Scheme, MIT LCS Technical Report 402 (Ph.D.
Dissertation), Massachusetts Institute of Technology,
Cambridge, Mass., August 1987.
82. M. Felleisen, D. P. Friedman, B. Duba and J. Merrill,
Beyond Continuations, Computer Science Dept. Technical
Report #216, Indiana University, Bloomington, Indiana,
February, 1987.
83. M. Felleisen and D. P. Friedman, A calculus for
assignments in higher-order languages, Conference
Record of the 14th Annual ACM Symposium on Principles
of Programming Languages, Munich, West Germany, January
1987, 314-345.
84. M. Felleisen and D. P. Friedman, A Syntactic Theory of
Sequential State, Computer Science Dept. Technical
Report #230, Indiana University, Bloomington, Indiana,
October 1987.
85. C. T. Haynes and D. P. Friedman, Embedding
continuations in procedural objects, ACM Transactions
on Programming Languages and Systems 9, 4 (October
1987), 582-598.
86. M. Eisenberg, Programming In Scheme, The Scientific
Press, Redwood City, CA, 1988.
87. D. Kranz, Orbit: An optimizing compiler for Scheme,
Computer Science Technical report #632 (Ph.D.
Dissertation), Yale University, 1988.
88. M. Wand and D. P. Friedman, The Mystery of the Tower
Revealed: A Non-Reflective Description of the
Reflective Tower, in Meta-Level Architectures and
Reflection, P. M. D. Nardi (ed.), Elsevier Sci.
Publishers B.V. (North Holland), 1988, 111-134. Also
to appear in Lisp and Symbolic Computation.
89. D. P. Friedman, M. Wand, C. T. Haynes and E. E.
Kohlbecker, in Programming Languages: Their
Abstractions, Representations, and Implementations, MIT
Press and McGraw-Hill, 1988-1989. in progress.
90. N. Adams and J. Rees, Object-Oriented Programming in
Scheme, Conference Record of the 1988 ACM Conference on
Lisp and Functional Programming, August 1988, 277-288.
91. W. D. Clinger, A. H. Hartheimer and E. M. Ost,
Implementation Strategies for Continuations, Conference
Record of the 1988 ACM Conference on Lisp and
Functional Programming, August 1988, 124 131.
92. H. Abelson and G. J. Sussman, Lisp: A Language for
Stratified Design, BYTE, February 1988, 207-218.
93. W. Clinger, Semantics of Scheme, BYTE, February 1988,
221-227.
94. A. Bawden and J. Rees, Syntactic Closures, Proceedings
of the 1988 ACM Symposium on LISP and Functional
Programming, Salt Lake City, Utah., July 1988.
95. R. K. Dybvig and R. Hieb, A Variable-Arity Procedural
Interface, Proceedings of the 1988 ACM Symposium on
LISP and Functional Programming, Salt Lake City, Utah,
July 1988, 106-115. Also Indiana University Computer
Science Department Technical Report #247.
96. M. Felleisen, M. Wand, D. P. Friedman and B. Duba,
Abstract Continuations: A Mathematical Semantics for
Handling Functional Jumps, Proceedings of the 1988 ACM
Symposium on LISP and Functional Programming, Salt Lake
City, Utah., July 1988.
97. R. K. Dybvig, D. P. Friedman and C. T. Haynes,
Expansion-Passing Style: A General Macro Mechanism,
Lisp and Symbolic Computation: An International Journal
1, 1 (June 1988), 53-76, Kluwer Academic Publishers.
98. O. Shivers, Control Flow Analysis in Scheme,
Proceedings of the Sigplan 1988 Conference on
Programming Language Design and Implementation,
Atlanta, Georgia, June 1988, 164-174.
99. J. Franco and D. P. Friedman, Creating Efficient
Programs by Exchanging Data for Procedures, Computer
Science Technical Report #245, Indiana University,
Bloomington, Indiana, March 1988.
100. K. J. Lang and B. A. Pearlmutter, Oaklisp: an Object-
Oriented Dialect of Scheme, Lisp and Symbolic
Computation: An International Journal 1, 1 (May 1988),
39-51, Kluwer Academic Publishers.
101. O. Shivers, The Semantics of Scheme Control Flow
Analysis (Preliminary)., Technical Report ERGO-90-090,
CMU School of Computer Science, Pittsburgh, Penn.,
November 1988.
102. R. K. Dybvig and R. Hieb, Engines from Continuations,
Journal of Computer Languages 14, 2 (1989), 109-123.
Also Indiana University Computer Science Department
Technical Report #254.
103. G. Springer and D. P. Friedman, in Scheme and the Art
of Programming, MIT Press and McGraw-Hill, 1989.
104. S. R. Vegdahl and U. F. Pleban, The Runtime Environment
for Screme, a Scheme Implementation on the 88000,
Proceedings of the Third International Conference on
Architectural Support for Programming Languages and
Operating Systems, Boston, Mass., April 1989, 172-182.
105. J. F. Bartlett, SCHEME->C a Portable Scheme-to-C
Compiler, Research Report 89/1, Dec. Western Research
Laboratory, Palo Alto, California, January 1989.
106. J. Rees, Modular Macros, Master's thesis, Department of
Electrical Engineering and Computer Science,
Massachusetts Institute of Technology, May 1989.
107. W. L. H. III, The Interprocedural Analysis and
Automatic Parallellization of Scheme Programs, Lisp and
Symbolic Computation: An International Journal 2, 3/4
(October 1989), , Kluwer Academic Publishers.
108. M. Eisenberg, W. Clinger and A. Hartheimer, Programming
In MacScheme, The Scientific Press, Redwood City, CA,
1990.
109. J. Franco and D. P. Friedman, Towards A Facility for
Lexically Scoped, Dynamic Mutual Recursion in Scheme,
Journal of Computer Languages 15, 1 (1990), 55-64,
Pergamon Press.
110. J. Franco, D. Friedman and S. Johnson, Multi-way
Streams in Scheme, Journal of Computer Languages 15, 2
(1990), 109-125.
111. S. Kamin, in Programming Languages: An Interpreter-
based Approach, Addison-Wesley, Reading, Mass., 1990.
112. G. Rozas and J. Miller, Free Variables and First-Class
Environments, Lisp and Symbolic Computation: An
International Journal 3, 4 (December 1990), , Kluwer
Academic Publishers.
113. K. Normark, Simulation of Object-Oriented Concepts and
Mechanisms in Scheme, Institute for Electronic Systems
Technical Report 90-01, Aalborg University, Aalborg,
Denmark, January 1990.
114. D. Sitaram and M. Felleisen, Control Delimiters and
Their Hierarchies, Lisp and Symbolic Computation: An
International Journal 3, 1 (January 1990), 67-99,
Kluwer Academic Publishers.
115. P. Curtis and J. Rauen, A Module System for Scheme,
Proceedings of the 1990 ACM Conference on Lisp and
Functional Programming, Nice, France, June 1990.
116. M. Feeley and J. S. Miller, A Parallel Virtual Machine
for Efficient Scheme Compilation, Proceedings of the
1990 ACM Conference on Lisp and Functional Programming,
Nice, France, June 1990.
117. C. Hanson, Efficient Stack Allocation for Tail-
Recursive Languages, Proceedings of the 1990 ACM
Conference on Lisp and Functional Programming, Nice,
France, June 1990.
118. M. Katz and D. Weise, Continuing Into the Future: On
the Interaction of Futures and First-Class
Continuations, Proceedings of the 1990 ACM Conference
on Lisp and Functional Programming, Nice, France, June
1990.
119. P. Bonzon, A Matacircular Evaluator for a Logical
Extension of Scheme, Lisp and Symbolic Computation: An
International Journal 3, 2 (March 1990), 113-133,
Kluwer Academic Publishers.
120. R. K. Dybvig and R. Hieb, Continuations and
Concurrency, Proceedings of the Second ACM SIGPLAN
Notices Symposium on Principles and Practice of
Parallel Programming, Seattle, Washington, March 1990,
128-136. Also Indiana University Computer Science
Department Technical Report #256.
121. O. Shivers, Data-Flow Analysis and Type Recovery in
Scheme. , Technical Report CMU-CS-90-115, CMU School of
Computer Science, Pittsburgh, Penn., March 1990. Also
to appear in Topics in Advanced Language
Implementation, Ed. Peter Lee, MIT Press..
122. R. K. Dybvig and R. Hieb, A New Approach to Procedures
with Variable Arity, Lisp and Symbolic Computation: An
International Journal 3, 3 (September 1990), 229-244,
Kluwer Academic Publishers.
123. R. Hieb, R. K. Dybvig and C. Bruggeman, Representing
Control in the Presence of First-Class Continuations,
Proceedings of the SIGPLAN Notices '90 Conference on
Programming Language Design and Implementation, White
Plains, New York, June 1990.