oz@yunexus.UUCP (Ozan Yigit) (08/17/88)
BIB/REFER Database on SCHEME
This posting contains is a reasonable bibliography database on Scheme
(a crystal in the muddy language landscape), BIB/REFER format,
containing 82 entries sorted by date and first author, for your
perusal, corrections and enjoyment. I do not consider it complete
nor correct, hence your contributions and/or corrections are
gratefully accepted.
[Note: this posting also contains a r2bib (BibTeX) translation of the
database. I think BibTeX format is losing. If anyone knows of a better
bibliography format suitable for TeX, please let me know.]
So, here it is for your enjoyment. Happy Scheming... oz
#! /bin/sh
# This is a shell archive. Remove anything before this line, then unpack
# it by saving it into a file and typing "sh file". To overwrite existing
# files, type "sh file -c". You can also feed this as standard input via
# unshar, or by typing "sh <file", e.g.. If this archive is complete, you
# will see the following message at the end:
# "End of shell archive."
# Contents: tags.doc scheme.bib scheme.bibtex
# Wrapped by oz@yunexus on Tue Aug 16 18:00:48 1988
PATH=/bin:/usr/bin:/usr/ucb ; export PATH
if test -f 'tags.doc' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'tags.doc'\"
else
echo shar: Extracting \"'tags.doc'\" \(422 characters\)
sed "s/^X//" >'tags.doc' <<'END_OF_FILE'
XBIB (UofArizona) Field Tags
X
X%A - Author's name
X%B - Title of the book containing item
X%C - City of publication
X%D - Date
X%E - Editor(s) of book containing item
X%F - Caption
X%G - Government (NTIS) ordering number
X%I - Issuer (publisher)
X%J - Journal name
X%K - Keys for searching
X%N - Issue number
X%O - Other information
X%P - Page(s) of article
X%R - Technical report number
X%S - Series title
X%T - Title
X%V - Volume number
END_OF_FILE
if test 422 -ne `wc -c <'tags.doc'`; then
echo shar: \"'tags.doc'\" unpacked with wrong size!
fi
# end of 'tags.doc'
fi
if test -f 'scheme.bib' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'scheme.bib'\"
else
echo shar: Extracting \"'scheme.bib'\" \(15607 characters\)
sed "s/^X//" >'scheme.bib' <<'END_OF_FILE'
X
X%A John Reynolds
X%T Definitional Interpreters for Higher Order Programming Languages
X%J ACM Conference Proceedings
X%P 717-740
X%I ACM
X%D 1972
X
X%A Gerald Jay Sussman
X%A Guy Lewis Steele, Jr.
X%T Scheme: an Interpreter for Extended Lambda Calculus
X%R MIT Artificial Intelligence Memo 349
X%C Cambridge, Mass.
X%D December 1975
X
X%A Guy Lewis Steele, Jr.
X%A Gerald Jay Sussman
X%T Lambda, the Ultimate Imperative
X%R MIT Artificial Intelligence Memo 353
X%C Cambridge, Mass.
X%D March 1976
X%K imperative
X
X%A Guy Lewis Steele, Jr.
X%T Lambda, the Ultimate Declarative
X%R MIT Artificial Intelligence Memo 379
X%C Cambridge, Mass.
X%D November 1976
X%K declarative
X
X%A Guy Lewis Steele, Jr.
X%T Debunking the ``Expensive Procedure Call'' Myth, or Procedure Call
XImplementations Considered Harmful, or LAMBDA, the Ultimate GOTO
X%J ACM Conference Proceedings
X%P 153-162
X%I ACM
X%D 1977
X
X%A Guy Lewis Steele, Jr.
X%T Macaroni is Better than Spaghetti
X%J Proceedings of the Symposium on Artificial Intelligence and
XProgramming Languages
X%P 60-66
X%O Special joint issue of SIGPLAN Notices 12(8) and SIGART Newsletter 64
X%D August 1977
X
X%A Mitchell Wand
X%T Continuation-Based Program Transformation Strategies
X%J Journal of the ACM
X%V 27
X%N 1
X%P 174-180
X%D 1978
X
X%A Guy Lewis Steele, Jr.
X%A Gerald Jay Sussman
X%T The Revised Report on Scheme, a Dialect of Lisp
X%R MIT Artificial Intelligence Memo 452
X%C Cambridge, Mass.
X%D January 1978
X
X%A Guy Lewis Steele, Jr.
X%T Rabbit: a Compiler for Scheme
X%R MIT Artificial Intelligence Laboratory Technical Report 474
X%C Cambridge, Mass.
X%D May 1978
X
X%A Guy Lewis Steele, Jr.
X%A Gerald Jay Sussman
X%T The Art of the Interpreter, or the Modularity Complex
X(parts zero, one, and two)
X%R MIT Artificial Intelligence Memo 453
X%C Cambridge, Mass.
X%D May 1978
X%K modularity
X
X%A Drew McDermott
X%T An Efficient Environment Allocation Scheme in an Interpreter
Xfor a Lexically-Scoped Lisp
X%J Conference Record of the 1980 Lisp Conference
X%P 154-162
X%I The Lisp Conference, P.O. Box 487, Redwood Estates CA.
X%D 1980
X%O Proceedings reprinted by ACM
X
X%A Steven S. Muchnick
X%A Uwe F. Pleban
X%T A Semantic Comparison of Lisp and Scheme
X%J Conference Record of the 1980 Lisp Conference
X%P 56-65
X%I The Lisp Conference, P.O. Box 487, Redwood Estates CA.
X%D 1980
X
X%A Guy Lewis Steele, Jr.
X%T Compiler Optimization Based on Viewing LAMBDA as RENAME + GOTO
X%B AI: An MIT Perspective
X%E Patrick Henry Winston
X%E Richard Henry Brown
X%I MIT Press
X%C Cambridge, Mass.
X%D 1980
X
X%A Guy Lewis Steele, Jr.
X%A Gerald Jay Sussman
X%T The Dream of a Lifetime: a Lazy Variable Extent Mechanism
X%J Conference Record of the 1980 Lisp Conference
X%P 163-172
X%I The Lisp Conference
X%D 1980
X
X%A Mitchell Wand
X%T Continuation-Based Multiprocessing
X%J Conference Record of the 1980 Lisp Conference
X%P 19-28
X%I The Lisp Conference
X%D 1980
X
X%A Guy Lewis Steele, Jr.
X%A Gerald Jay Sussman
X%T Design of a Lisp-based Processor
X%J CACM
X%V 23
X%N 11
X%P 628-645
X%D November 1980
X
X%A Gerald Jay Sussman
X%A Jack Holloway
X%A Guy Lewis Steele, Jr.
X%A Alan Bell
X%T Scheme-79 - Lisp on a Chip
X%J IEEE Computer
X%V 14
X%N 7
X%P 10-21
X%D July 1981
X%I IEEE
X
X%A John Batali
X%A Edmund Goodhue
X%A Chris Hanson
X%A Howie Shrobe
X%A Richard M. Stallman
X%A Gerald Jay Sussman
X%T The Scheme-81 Architecture - System and Chip
X%J Proceedings, Conference on Advanced Research in VLSI
X%P 69-77
X%E Paul Penfield, Jr.
X%C Artech House, Dedham MA.
X%D 1982
X%K scheme81
X
X%A Peter Henderson
X%T Functional Geometry
X%J Conference Record of the 1982 ACM Symposium on Lisp and
XFunctional Programming
X%P 179-187
X%D 1982
X
X%A Jonathan A. Rees
X%A Norman I. Adams
X%T T: A Dialect of Lisp or, LAMBDA: The Ultimate Software Tool
X%J Conference Record of the 1982 ACM Symposium on Lisp and
XFunctional Programming
X%P 114-122
X%D 1982
X
X%A Gerald Jay Sussman
X%T LISP, Programming and Implementation
X%B Functional Programming and its Applications
X%E Darlington, Henderson, Turner
X%I Cambridge University Press
X%C London
X%D 1982
X
X%A Pee Hong Chen
X%A W.Y. Chi
X%A E.M. Ost
X%A L.D. Sabbagh
X%A G. Springer
X%T Scheme Graphics Reference Manual
X%R Computer Science Technical Report No. 145
X%I Indiana University
X%C Bloomington, Indiana
X%D August 1983
X
X%A Pee Hong Chen
X%A Daniel P. Friedman
X%T Prototyping data flow by translation into Scheme
X%R Computer Science Technical Report #147
X%I Indiana University
X%C Bloomington, Indiana
X%D August 1983
X
X%A Carol Fessenden
X%A William Clinger
X%A Daniel P. Friedman
X%A Christopher T. Haynes
X%T Scheme 311 version 4 Reference Manual
X%R Computer Science Technical Report 137
X%I Indiana University
X%C Bloomington, Indiana
X%D February 1983
X%O Superceded by Computer Science Technical Report 153, 1985
X
X%A William Clinger
X%T The Scheme 311 compiler: An Exercise in Denotational Semantics
X%J Conference Record of the 1984 ACM Symposium on Lisp and
XFunctional Programming
X%P 356-364
X%D 1984
X%K comp311
X
X%A Daniel P. Friedman
X%A Christopher T. Haynes
X%A Eugene E. Kohlbecker
X%T Programming with Continuations
X%B Program Transformation and Programming Environments
X%P 263-274
X%E P. Pepper
X%I Springer-Verlag
X%D 1984
X
X%A Christopher T. Haynes
X%A Daniel P. Friedman
X%T Engines Build Process Abstractions
X%J Conference Record of the 1984 ACM Symposium on Lisp and
XFunctional Programming
X%C Austin, TX.
X%P 18-24
X%D 1984
X
X%A Christopher T. Haynes
X%A Daniel P. Friedman
X%A Mitchell Wand
X%T Continuations and Coroutines
X%J Conference Record of the 1984 ACM Symposium on Lisp and
XFunctional Programming
X%C Austin, TX.
X%P 293-298
X%D 1984
X
X%A Daniel P. Friedman
X%A Mitchell Wand
X%T Reification: reflection without metaphysics
X%J Conference Record of the 1984 ACM Symposium on LISP and Functional
XProgramming
X%C Austin, TX.
X%P 348-355
X%D August 1984
X
X%A Jonathan A. Rees
X%A Norman I. Adams
X%A James R. Meehan
X%T The T manual, fourth edition
X%I Yale University Computer Science Department
X%D January 1984
X
X%A Guillermo J. Rozas
X%T Liar, an Algol-like Compiler for Scheme
X%I S. B. Thesis, MIT Department of Electrical Engineering and Computer
XScience
X%D January 1984
X
X%T MIT Scheme Manual, Seventh Edition
X%I Department of Electrical Engineering and Computer Science, MIT
X%C Cambridge, Mass.
X%D September 1984
X
X%T MacScheme Reference Manual
X%I Semantic Microsystems
X%C Sausalito, Calif.
X%D 1985
X
X%A Harold Abelson
X%A Gerald Jay Sussman
X%A Julie Sussman
X%T Structure and Interpretation of Computer Programs
X%I MIT Press
X%C Cambridge, Mass.
X%D 1985
X%K sicp
X
X%A William Clinger
X%A Daniel P. Friedman
X%A Mitchell Wand
X%T A Scheme for a Higher-Level Semantic Algebra
X%B Algebraic Methods in Semantics
X%E J. Reynolds, M. Nivat
X%P 237-250
X%I Cambridge University Press
X%C London
X%D 1985
X
X%A Amitabh Srivastava
X%A Don Oxley
X%A Aditya Srivastava
X%T An (other) Integration of Logic and Functional Programming
X%J Proceedings of the Symposium on Logic Programming
X%P 254-260
X%I IEEE
X%D 1985
X
X%E William Clinger
X%T The Revised Revised Report on Scheme, or An Uncommon Lisp
X%R MIT Artificial Intelligence Memo 848
X%C Cambridge, Mass.
X%O Also published as Computer Science Department Technical Report 174,
XIndiana University, June 1985
X%D August 1985
X%K rrrs
X
X%A Daniel P. Friedman
X%A Christopher T. Haynes
X%T Constraining Control
X%J Proceedings of the Twelfth Annual Symposium on Principles of
XProgramming Languages
X%C New Orleans, LA.
X%P 245-254
X%I ACM
X%D January 1985
X
X%A Daniel P. Friedman
X%A Christopher T. Haynes
X%A Eugene E. Kohlbecker
X%A Mitchell Wand
X%T Scheme 84 Interim Reference Manual
X%R Computer Science Technical Report 153
X%I Indiana University
X%C Bloomington, Indiana
X%D January 1985
X%K scheme84
X
X%A Peehong Chen
X%A L. David Sabbagh
X%T Scheme as an Interactive Graphics Programming Environment
X%R Computer Science Technical Report No. 166
X%I Indiana University
X%C Bloomington, Indiana
X%D March 1985
X
X%T TI Scheme Language Reference Manual
X%I Texas Instruments, Inc.
X%O Preliminary version 1.0
X%D November 1985
X
X%A Michael A. Eisenberg
X%T Bochser: An Integrated Scheme Programming System
X%R MIT Computer Science Technical Report 349
X%C Cambridge, Mass.
X%D October 1985
X%K bochser
X
X%T Transliterating Prolog into Scheme
X%A Matthias Felleisen
X%R Computer Science Technical Report #182
X%I Indiana University
X%C Bloomington, Indiana
X%D October 1985
X
X%A David H. Bartley
X%A John C. Jensen
X%T The Implementation of PC Scheme
X%J Proceedings of the 1986 ACM Conference on Lisp
Xand Functional Programming
X%P 86-93
X%D 1986
X%K pcscheme
X
X%A R. Kent Dybvig
X%A Daniel P. Friedman
X%A Christopher T. Haynes
X%T Expansion-Passing style: Beyond Conventional Macros
X%J Proceedings of the 1986 ACM Conference on Lisp and
XFunctional Programming
X%P 143-150
X%D 1986
X
X%A Marc Feeley
X%A Guy LaPalme
X%T Closure Generation based on viewing LAMBDA as EPSILON plus COMPILE
X%O Submitted for Publication
X%D 1986
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%T A Closer Look At Export and Import Statements
X%J Journal of Computer Languages
X%V 11
X%N 1
X%P 29-37
X%I Pergamon Press
X%D 1986
X
X%A Daniel P. Friedman
X%A Matthias Felleisen
X%T The Little LISPer: Second Edition
X%I Science Research Associates, Inc.
X%C Palo Alto, California
X%D 1986
X
X%A Christopher T. Haynes
X%A Daniel P. Friedman
X%A Mitchell Wand
X%T Obtaining Coroutines With Continuations
X%J Journal of Computer Languages
X%V 11
X%N 3/4
X%P 143-153
X%I Pergamon Press
X%D 1986
X
X%A Mitchell Wand
X%T Finding the Source of Type Errors
X%J Conference Record of the Thirteenth Annual Symposium on
XPrinciples of Programming Languages
X%P 38-43
X%I ACM
X%C St. Peterburg, Fla.
X%D 1986
X
X%A Mitchell Wand
X%T From Interpreter to Compiler: A Representational Derivation
X%B Programs as Data Objects
X%I Springer-Verlag Lecture Notes
X%D 1986
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%T Control operators, the SECD-machine, and the lambda-calculus
X%J 3rd Working Conference on the Formal Description of
XProgramming Concepts
X%C Ebberup, Denmark
X%P 193-219
X%D August 1986
X
X%A Eugene E. Kohlbecker
X%T Syntactic Extensions in the Programming Language Lisp
X%R Computer Science Technical Report #199 (PhD Dissertation)
X%I Indiana University
X%C Bloomington, Indiana
X%D August 1986
X
X%A Eugene E. Kohlbecker
X%A Daniel P. Friedman
X%A Matthias Felleisen
X%A Bruce Duba
X%T Hygienic macro expansion
X%J Symposium on LISP and Functional Programming
X%P 151-161
X%D August 1986
X%O To appear in Lisp and Symbolic Computation
X
X%A Mitchell Wand
X%T The mystery of the tower revealed: a non-reflective
Xdescription of the reflective tower
X%J Proceedings of the 1986 ACM Symposium on LISP and Functional Programming
X%P 298-307
X%D August 1986
X
X%E Jonathan A. Rees
X%E William Clinger
X%T Revised^3 Report on the Algorithmic Language Scheme
X%J ACM Sigplan Notices
X%V 21
X%N 12
X%D December 1986
X
X%A Christopher T. Haynes
X%T Logic Continuations
X%J Proceedings of the Third International Conference on
XLogic Programming
X%P 671-685
X%I Springer-Verlag
X%D Jul 1986
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%A Eugene E. Kohlbecker
X%A Bruce Duba
X%T Reasoning with Continuations
X%J Proceedings of the Symposium on Logic in Computer Science
X%P 131-141
X%I IEEE Computer Society Press
X%C Washigton DC
X%D June 1986
X
X%A David Kranz
X%A Richard Kelsey
X%A Jonathan A. Rees
X%A Paul Hudak
X%A James Philbin
X%A Norman I. Adams
X%T Orbit: An Optimizing Compiler for Scheme
X%J Proceedings of the SIGPLAN '86 Symposium on Compiler
XConstruction
X%P 219-233
X%I ACM
X%O Published as SIGPLAN Notices 21(7), July 1986
X%D June 1986
X%K orbit
X
X%A Marc Feeley
X%T Deux Approches a' L'implantation du Language Scheme
X%I M.Sc. Thesis, De'partement d'Informatique et de Recherche
XOpe'rationelle, University of Montreal
X%D May 1986
X
X%A R. Kent Dybvig
X%T The Scheme Programming Language
X%I Prentice-Hall, Inc.
X%C Englewood Cliffs, New Jersey
X%D 1987
X%K splang
X
X%A Marc Feeley
X%A Guy LaPalme
X%T Using Cloures for Code Generation
X%J Journal of Computer Languages
X%V 12
X%N 1
X%P 47-66
X%I Pergamon Press
X%D 1987
X
X%A Matthias Felleisen
X%T Reflections on Landin's J-Operator: A Partly Historical Note
X%J Journal of Computer Languages
X%V 12
X%N 3/4
X%P 197-207
X%I Pergamon Press
X%D 1987
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%T A Reduction Semantics for Imperative Higher-Order Languages
X%J Parallel Architectures and Languages Europe
X%E De Bakker, Nijman and Treleaven
X%B Lecture Notes in Computer Science
X%V 259
X%I Springer-Verlag
X%C Berlin
X%P 206-223
X%D 1987
X
X%T A syntactic theory of sequential control
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%A Eugene E. Kohlbecker
X%A Bruce Duba
X%J Theoretical Computer Science
X%V 52
X%P 205-237
X%D 1987
X
X%A Daniel P. Friedman
X%A Matthias Felleisen
X%T The Little LISPer
X%I MIT Press
X%D 1987
X%O Trade Edition
X%K littlelisper
X
X%A Christopher T. Haynes
X%A Daniel P. Friedman
X%T Abstracting Timed Preemption with Engines
X%J Journal of Computer Languages
X%V 12
X%N 2
X%P 109-121
X%I Pergamon Press
X%D 1987
X
X%A Matthias Felleisen
X%T The Calculi of lambda-v-cs conversion: a syntactic
Xtheory of control and state in imperative higher-order programming
Xlanguages
X%R Computer Science Technical Report #226. (PhD Dissertation)
X%I Indiana University
X%C Bloomington, Indiana
X%D August 1987
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%A Bruce Duba
X%A John Merrill
X%T Beyond Continuations
X%R Computer Science Dept. Technical Report #216
X%I Indiana University
X%C Bloomington, Indiana
X%D February, 1987
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%T A calculus for assignments in higher-order languages
X%J Conference Record of the 14th Annual ACM Symposium on Principles of
XProgramming Languages
X%C Munich, West Germany
X%P 314-345
X%D January 1987
X
X%A Matthias Felleisen
X%A Daniel P. Friedman
X%T A Syntactic Theory of Sequential State
X%R Computer Science Dept. Technical Report #230
X%I Indiana University
X%C Bloomington, Indiana
X%D October 1987
X
X%T Embedding continuations in procedural objects
X%A Christopher T. Haynes
X%A Daniel P. Friedman
X%J ACM Transactions on Programming Languages and Systems
X%V 9
X%N 4
X%P 582-598
X%D October 1987
X
X%A Michael Eisenberg
X%T Programming In Scheme
X%E Harold Abelson
X%I Scientific Press
X%C Redwood City, CA
X%D 1988
X
X%A Mitchell Wand
X%A Daniel P. Friedman
X%T The Mystery of the Tower Revealed: A Non-Reflective
XDescription of the Reflective Tower
X%B Meta-Level Architectures and Reflection
X%E P. Maes and D. Nardi
X%I Elsevier Sci. Publishers B.V. (North Holland)
X%P 111-134
X%D 1988
X%O Also to appear in Lisp and Symbolic Computation
X
X%A Daniel P. Friedman
X%A Mitchell Wand
X%A Christopher T. Haynes
X%A Eugene E. Kohlbecker
X%T Programming Languages: Their Abstractions, Representations,
Xand Implementations
X%I M.I.T. Press and McGraw Hill
X%D 1988-1989
X%O in progress
X
X%A George Springer
X%A Daniel P. Friedman
X%T An Introduction to the Art of Programming in Scheme
X%D 1988-1989
X%O in progress
X
X%A Harold Abelson
X%A Gerald Jay Sussman
X%T Lisp: A Langauge for Stratified Design
X%J BYTE
X%D February 1988
X%P 207-218
X
X%A William Clinger
X%T Semantics of Scheme
X%J BYTE
X%D February 1988
X%P 221-227
X
X%A Alan Bawden
X%A Jonathan Rees
X%T Syntactic Closures
X%J Proceedings of the 1988 ACM Symposium on LISP
Xand Functional Programming
X%C Salt Lake City, Utah.
X%D July 1988
X
X%A Matthias Felleisen
X%A Mitchell Wand
X%A Daniel P. Friedman
X%A Bruce Duba
X%T Abstract Continuations: A Mathematical Semantics for
XHandling Functional Jumps
X%J Proceedings of the 1988 ACM Symposium on LISP
Xand Functional Programming
X%C Salt Lake City, Utah.
X%D July 1988
X
X%A John Franco
X%A Daniel P. Friedman
X%T Creating Efficient Programs by Exchanging Data for Procedures
X%R Computer Science Technical Report #245
X%I Indiana University
X%C Bloomington, Indiana
X%D March 1988
X
X%A Mitchell Wand
X%A Daniel P. Friedman
X%T Compiling lambda expressions using continuations and
Xfactorizations
X%J Computer Languages 3
X%D 241-263
X%D 1978
END_OF_FILE
if test 15607 -ne `wc -c <'scheme.bib'`; then
echo shar: \"'scheme.bib'\" unpacked with wrong size!
fi
# end of 'scheme.bib'
fi
if test -f 'scheme.bibtex' -a "${1}" != "-c" ; then
echo shar: Will not clobber existing file \"'scheme.bibtex'\"
else
echo shar: Extracting \"'scheme.bibtex'\" \(20265 characters\)
sed "s/^X//" >'scheme.bibtex' <<'END_OF_FILE'
X@article{key1,
X author = "John Reynolds",
X year = "1972",
X publisher = "ACM",
X journal = "ACM Conference Proceedings",
X pages = "717-740",
X title = "Definitional Interpreters for Higher Order Programming Languages"
X}
X
X@techreport{key2,
X author = "Gerald Jay Sussman and Guy Lewis Steele, Jr.",
X address = "Cambridge, Mass.",
X year = "December 1975",
X title = "Scheme: an Interpreter for Extended Lambda Calculus"
X}
X
X@techreport{imperative,
X author = "Guy Lewis Steele, Jr. and Gerald Jay Sussman",
X address = "Cambridge, Mass.",
X year = "March 1976",
X title = "Lambda, the Ultimate Imperative"
X}
X
X@techreport{declarative,
X author = "Guy Lewis Steele, Jr.",
X address = "Cambridge, Mass.",
X year = "November 1976",
X title = "Lambda, the Ultimate Declarative"
X}
X
X@article{key5,
X author = "Guy Lewis Steele, Jr.",
X year = "1977",
X publisher = "ACM",
X journal = "ACM Conference Proceedings",
X pages = "153-162",
X title = "Debunking the ``Expensive Procedure Call'' Myth, or Procedure Call Implementations Considered Harmful, or LAMBDA, the Ultimate GOTO"
X}
X
X@article{key6,
X author = "Guy Lewis Steele, Jr.",
X year = "August 1977",
X journal = "Proceedings of the Symposium on Artificial Intelligence and Programming Languages",
X pages = "60-66",
X title = "Macaroni is Better than Spaghetti"
X}
X
X@article{key7,
X author = "Mitchell Wand",
X year = "1978",
X journal = "Journal of the ACM",
X number = "1",
X pages = "174-180",
X title = "Continuation-Based Program Transformation Strategies",
X volume = "27"
X}
X
X@techreport{key8,
X author = "Guy Lewis Steele, Jr. and Gerald Jay Sussman",
X address = "Cambridge, Mass.",
X year = "January 1978",
X title = "The Revised Report on Scheme, a Dialect of Lisp"
X}
X
X@techreport{key9,
X author = "Guy Lewis Steele, Jr.",
X address = "Cambridge, Mass.",
X year = "May 1978",
X title = "Rabbit: a Compiler for Scheme"
X}
X
X@techreport{modularity,
X author = "Guy Lewis Steele, Jr. and Gerald Jay Sussman",
X address = "Cambridge, Mass.",
X year = "May 1978",
X title = "The Art of the Interpreter, or the Modularity Complex (parts zero, one, and two)"
X}
X
X@article{key11,
X author = "Drew McDermott",
X year = "1980",
X publisher = "The Lisp Conference, P.O. Box 487, Redwood Estates CA.",
X journal = "Conference Record of the 1980 Lisp Conference",
X pages = "154-162",
X title = "An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp"
X}
X
X@article{key12,
X author = "Steven S. Muchnick and Uwe F. Pleban",
X year = "1980",
X publisher = "The Lisp Conference, P.O. Box 487, Redwood Estates CA.",
X journal = "Conference Record of the 1980 Lisp Conference",
X pages = "56-65",
X title = "A Semantic Comparison of Lisp and Scheme"
X}
X
X@book{key13,
X author = "Guy Lewis Steele, Jr.",
X booktitle = "AI: An MIT Perspective",
X address = "Cambridge, Mass.",
X year = "1980",
X editor = "Patrick Henry Winston Richard Henry Brown",
X publisher = "MIT Press",
X title = "Compiler Optimization Based on Viewing LAMBDA as RENAME + GOTO"
X}
X
X@article{key14,
X author = "Guy Lewis Steele, Jr. and Gerald Jay Sussman",
X year = "1980",
X publisher = "The Lisp Conference",
X journal = "Conference Record of the 1980 Lisp Conference",
X pages = "163-172",
X title = "The Dream of a Lifetime: a Lazy Variable Extent Mechanism"
X}
X
X@article{key15,
X author = "Mitchell Wand",
X year = "1980",
X publisher = "The Lisp Conference",
X journal = "Conference Record of the 1980 Lisp Conference",
X pages = "19-28",
X title = "Continuation-Based Multiprocessing"
X}
X
X@article{key16,
X author = "Guy Lewis Steele, Jr. and Gerald Jay Sussman",
X year = "November 1980",
X journal = "CACM",
X number = "11",
X pages = "628-645",
X title = "Design of a Lisp-based Processor",
X volume = "23"
X}
X
X@article{key17,
X author = "Gerald Jay Sussman and Jack Holloway and Guy Lewis Steele, Jr. and Alan Bell",
X year = "July 1981",
X publisher = "IEEE",
X journal = "IEEE Computer",
X number = "7",
X pages = "10-21",
X title = "Scheme-79 - Lisp on a Chip",
X volume = "14"
X}
X
X@article{scheme81,
X author = "John Batali and Edmund Goodhue and Chris Hanson and Howie Shrobe and Richard M. Stallman and Gerald Jay Sussman",
X address = "Artech House, Dedham MA.",
X year = "1982",
X editor = "Paul Penfield, Jr.",
X journal = "Proceedings, Conference on Advanced Research in VLSI",
X pages = "69-77",
X title = "The Scheme-81 Architecture - System and Chip"
X}
X
X@article{key19,
X author = "Peter Henderson",
X year = "1982",
X journal = "Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming",
X pages = "179-187",
X title = "Functional Geometry"
X}
X
X@article{key20,
X author = "Jonathan A. Rees and Norman I. Adams",
X year = "1982",
X journal = "Conference Record of the 1982 ACM Symposium on Lisp and Functional Programming",
X pages = "114-122",
X title = "T: A Dialect of Lisp or, LAMBDA: The Ultimate Software Tool"
X}
X
X@book{key21,
X author = "Gerald Jay Sussman",
X booktitle = "Functional Programming and its Applications",
X address = "London",
X year = "1982",
X editor = "Darlington, Henderson, Turner",
X publisher = "Cambridge University Press",
X title = "LISP, Programming and Implementation"
X}
X
X@techreport{key22,
X author = "Pee Hong Chen and W.Y. Chi and E.M. Ost and L.D. Sabbagh and G. Springer",
X address = "Bloomington, Indiana",
X year = "August 1983",
X publisher = "Indiana University",
X title = "Scheme Graphics Reference Manual"
X}
X
X@techreport{key23,
X author = "Pee Hong Chen and Daniel P. Friedman",
X address = "Bloomington, Indiana",
X year = "August 1983",
X publisher = "Indiana University",
X title = "Prototyping data flow by translation into Scheme"
X}
X
X@techreport{key24,
X author = "Carol Fessenden and William Clinger and Daniel P. Friedman and Christopher T. Haynes",
X address = "Bloomington, Indiana",
X year = "February 1983",
X publisher = "Indiana University",
X title = "Scheme 311 version 4 Reference Manual"
X}
X
X@article{comp311,
X author = "William Clinger",
X year = "1984",
X journal = "Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming",
X pages = "356-364",
X title = "The Scheme 311 compiler: An Exercise in Denotational Semantics"
X}
X
X@book{key26,
X author = "Daniel P. Friedman and Christopher T. Haynes and Eugene E. Kohlbecker",
X booktitle = "Program Transformation and Programming Environments",
X year = "1984",
X editor = "P. Pepper",
X publisher = "Springer-Verlag",
X pages = "263-274",
X title = "Programming with Continuations"
X}
X
X@article{key27,
X author = "Christopher T. Haynes and Daniel P. Friedman",
X address = "Austin, TX.",
X year = "1984",
X journal = "Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming",
X pages = "18-24",
X title = "Engines Build Process Abstractions"
X}
X
X@article{key28,
X author = "Christopher T. Haynes and Daniel P. Friedman and Mitchell Wand",
X address = "Austin, TX.",
X year = "1984",
X journal = "Conference Record of the 1984 ACM Symposium on Lisp and Functional Programming",
X pages = "293-298",
X title = "Continuations and Coroutines"
X}
X
X@article{key29,
X author = "Daniel P. Friedman and Mitchell Wand",
X address = "Austin, TX.",
X year = "August 1984",
X journal = "Conference Record of the 1984 ACM Symposium on LISP and Functional Programming",
X pages = "348-355",
X title = "Reification: reflection without metaphysics"
X}
X
X@book{key30,
X author = "Jonathan A. Rees and Norman I. Adams and James R. Meehan",
X year = "January 1984",
X publisher = "Yale University Computer Science Department",
X title = "The T manual, fourth edition"
X}
X
X@book{key31,
X author = "Guillermo J. Rozas",
X year = "January 1984",
X publisher = "S. B. Thesis, MIT Department of Electrical Engineering and Computer Science",
X title = "Liar, an Algol-like Compiler for Scheme"
X}
X
X@book{key32,
X address = "Cambridge, Mass.",
X year = "September 1984",
X publisher = "Department of Electrical Engineering and Computer Science, MIT",
X title = "MIT Scheme Manual, Seventh Edition"
X}
X
X@book{key33,
X address = "Sausalito, Calif.",
X year = "1985",
X publisher = "Semantic Microsystems",
X title = "MacScheme Reference Manual"
X}
X
X@book{sicp,
X author = "Harold Abelson and Gerald Jay Sussman and Julie Sussman",
X address = "Cambridge, Mass.",
X year = "1985",
X publisher = "MIT Press",
X title = "Structure and Interpretation of Computer Programs"
X}
X
X@book{key35,
X author = "William Clinger and Daniel P. Friedman and Mitchell Wand",
X booktitle = "Algebraic Methods in Semantics",
X address = "London",
X year = "1985",
X editor = "J. Reynolds, M. Nivat",
X publisher = "Cambridge University Press",
X pages = "237-250",
X title = "A Scheme for a Higher-Level Semantic Algebra"
X}
X
X@article{key36,
X author = "Amitabh Srivastava and Don Oxley and Aditya Srivastava",
X year = "1985",
X publisher = "IEEE",
X journal = "Proceedings of the Symposium on Logic Programming",
X pages = "254-260",
X title = "An (other) Integration of Logic and Functional Programming"
X}
X
X@techreport{rrrs,
X address = "Cambridge, Mass.",
X year = "August 1985",
X editor = "William Clinger",
X title = "The Revised Revised Report on Scheme, or An Uncommon Lisp"
X}
X
X@article{key38,
X author = "Daniel P. Friedman and Christopher T. Haynes",
X address = "New Orleans, LA.",
X year = "January 1985",
X publisher = "ACM",
X journal = "Proceedings of the Twelfth Annual Symposium on Principles of Programming Languages",
X pages = "245-254",
X title = "Constraining Control"
X}
X
X@techreport{scheme84,
X author = "Daniel P. Friedman and Christopher T. Haynes and Eugene E. Kohlbecker and Mitchell Wand",
X address = "Bloomington, Indiana",
X year = "January 1985",
X publisher = "Indiana University",
X title = "Scheme 84 Interim Reference Manual"
X}
X
X@techreport{key40,
X author = "Peehong Chen and L. David Sabbagh",
X address = "Bloomington, Indiana",
X year = "March 1985",
X publisher = "Indiana University",
X title = "Scheme as an Interactive Graphics Programming Environment"
X}
X
X@book{key41,
X year = "November 1985",
X publisher = "Texas Instruments, Inc.",
X title = "TI Scheme Language Reference Manual"
X}
X
X@techreport{bochser,
X author = "Michael A. Eisenberg",
X address = "Cambridge, Mass.",
X year = "October 1985",
X title = "Bochser: An Integrated Scheme Programming System"
X}
X
X@techreport{key43,
X author = "Matthias Felleisen",
X address = "Bloomington, Indiana",
X year = "October 1985",
X publisher = "Indiana University",
X title = "Transliterating Prolog into Scheme"
X}
X
X@article{pcscheme,
X author = "David H. Bartley and John C. Jensen",
X year = "1986",
X journal = "Proceedings of the 1986 ACM Conference on Lisp and Functional Programming",
X pages = "86-93",
X title = "The Implementation of PC Scheme"
X}
X
X@article{key45,
X author = "R. Kent Dybvig and Daniel P. Friedman and Christopher T. Haynes",
X year = "1986",
X journal = "Proceedings of the 1986 ACM Conference on Lisp and Functional Programming",
X pages = "143-150",
X title = "Expansion-Passing style: Beyond Conventional Macros"
X}
X
X@misc{key46,
X author = "Marc Feeley and Guy LaPalme",
X year = "1986",
X title = "Closure Generation based on viewing LAMBDA as EPSILON plus COMPILE"
X}
X
X@article{key47,
X author = "Matthias Felleisen and Daniel P. Friedman",
X year = "1986",
X publisher = "Pergamon Press",
X journal = "Journal of Computer Languages",
X number = "1",
X pages = "29-37",
X title = "A Closer Look At Export and Import Statements",
X volume = "11"
X}
X
X@book{key48,
X author = "Daniel P. Friedman and Matthias Felleisen",
X address = "Palo Alto, California",
X year = "1986",
X publisher = "Science Research Associates, Inc.",
X title = "The Little LISPer: Second Edition"
X}
X
X@article{key49,
X author = "Christopher T. Haynes and Daniel P. Friedman and Mitchell Wand",
X year = "1986",
X publisher = "Pergamon Press",
X journal = "Journal of Computer Languages",
X number = "3/4",
X pages = "143-153",
X title = "Obtaining Coroutines With Continuations",
X volume = "11"
X}
X
X@article{key50,
X author = "Mitchell Wand",
X address = "St. Peterburg, Fla.",
X year = "1986",
X publisher = "ACM",
X journal = "Conference Record of the Thirteenth Annual Symposium on Principles of Programming Languages",
X pages = "38-43",
X title = "Finding the Source of Type Errors"
X}
X
X@book{key51,
X author = "Mitchell Wand",
X booktitle = "Programs as Data Objects",
X year = "1986",
X publisher = "Springer-Verlag Lecture Notes",
X title = "From Interpreter to Compiler: A Representational Derivation"
X}
X
X@article{key52,
X author = "Matthias Felleisen and Daniel P. Friedman",
X address = "Ebberup, Denmark",
X year = "August 1986",
X journal = "3rd Working Conference on the Formal Description of Programming Concepts",
X pages = "193-219",
X title = "Control operators, the SECD-machine, and the lambda-calculus"
X}
X
X@techreport{key53,
X author = "Eugene E. Kohlbecker",
X address = "Bloomington, Indiana",
X year = "August 1986",
X publisher = "Indiana University",
X title = "Syntactic Extensions in the Programming Language Lisp"
X}
X
X@article{key54,
X author = "Eugene E. Kohlbecker and Daniel P. Friedman and Matthias Felleisen and Bruce Duba",
X year = "August 1986",
X journal = "Symposium on LISP and Functional Programming",
X pages = "151-161",
X title = "Hygienic macro expansion"
X}
X
X@article{key55,
X author = "Mitchell Wand",
X year = "August 1986",
X journal = "Proceedings of the 1986 ACM Symposium on LISP and Functional Programming",
X pages = "298-307",
X title = "The mystery of the tower revealed: a non-reflective description of the reflective tower"
X}
X
X@article{key56,
X year = "December 1986",
X editor = "Jonathan A. Rees William Clinger",
X journal = "ACM Sigplan Notices",
X number = "12",
X title = "Revised^3 Report on the Algorithmic Language Scheme",
X volume = "21"
X}
X
X@article{key57,
X author = "Christopher T. Haynes",
X year = "Jul 1986",
X publisher = "Springer-Verlag",
X journal = "Proceedings of the Third International Conference on Logic Programming",
X pages = "671-685",
X title = "Logic Continuations"
X}
X
X@article{key58,
X author = "Matthias Felleisen and Daniel P. Friedman and Eugene E. Kohlbecker and Bruce Duba",
X address = "Washigton DC",
X year = "June 1986",
X publisher = "IEEE Computer Society Press",
X journal = "Proceedings of the Symposium on Logic in Computer Science",
X pages = "131-141",
X title = "Reasoning with Continuations"
X}
X
X@article{orbit,
X author = "David Kranz and Richard Kelsey and Jonathan A. Rees and Paul Hudak and James Philbin and Norman I. Adams",
X year = "June 1986",
X publisher = "ACM",
X journal = "Proceedings of the SIGPLAN '86 Symposium on Compiler Construction",
X pages = "219-233",
X title = "Orbit: An Optimizing Compiler for Scheme"
X}
X
X@book{key60,
X author = "Marc Feeley",
X year = "May 1986",
X publisher = "M.Sc. Thesis, De'partement d'Informatique et de Recherche Ope'rationelle, University of Montreal",
X title = "Deux Approches a' L'implantation du Language Scheme"
X}
X
X@book{splang,
X author = "R. Kent Dybvig",
X address = "Englewood Cliffs, New Jersey",
X year = "1987",
X publisher = "Prentice-Hall, Inc.",
X title = "The Scheme Programming Language"
X}
X
X@article{key62,
X author = "Marc Feeley and Guy LaPalme",
X year = "1987",
X publisher = "Pergamon Press",
X journal = "Journal of Computer Languages",
X number = "1",
X pages = "47-66",
X title = "Using Cloures for Code Generation",
X volume = "12"
X}
X
X@article{key63,
X author = "Matthias Felleisen",
X year = "1987",
X publisher = "Pergamon Press",
X journal = "Journal of Computer Languages",
X number = "3/4",
X pages = "197-207",
X title = "Reflections on Landin's J-Operator: A Partly Historical Note",
X volume = "12"
X}
X
X@article{key64,
X author = "Matthias Felleisen and Daniel P. Friedman",
X booktitle = "Lecture Notes in Computer Science",
X address = "Berlin",
X year = "1987",
X editor = "De Bakker, Nijman and Treleaven",
X publisher = "Springer-Verlag",
X journal = "Parallel Architectures and Languages Europe",
X pages = "206-223",
X title = "A Reduction Semantics for Imperative Higher-Order Languages",
X volume = "259"
X}
X
X@article{key65,
X author = "Matthias Felleisen and Daniel P. Friedman and Eugene E. Kohlbecker and Bruce Duba",
X year = "1987",
X journal = "Theoretical Computer Science",
X pages = "205-237",
X title = "A syntactic theory of sequential control",
X volume = "52"
X}
X
X@book{littlelisper,
X author = "Daniel P. Friedman and Matthias Felleisen",
X year = "1987",
X publisher = "MIT Press",
X title = "The Little LISPer"
X}
X
X@article{key67,
X author = "Christopher T. Haynes and Daniel P. Friedman",
X year = "1987",
X publisher = "Pergamon Press",
X journal = "Journal of Computer Languages",
X number = "2",
X pages = "109-121",
X title = "Abstracting Timed Preemption with Engines",
X volume = "12"
X}
X
X@techreport{key68,
X author = "Matthias Felleisen",
X address = "Bloomington, Indiana",
X year = "August 1987",
X publisher = "Indiana University",
X title = "The Calculi of lambda-v-cs conversion: a syntactic theory of control and state in imperative higher-order programming languages"
X}
X
X@techreport{key69,
X author = "Matthias Felleisen and Daniel P. Friedman and Bruce Duba and John Merrill",
X address = "Bloomington, Indiana",
X year = "February, 1987",
X publisher = "Indiana University",
X title = "Beyond Continuations"
X}
X
X@article{key70,
X author = "Matthias Felleisen and Daniel P. Friedman",
X address = "Munich, West Germany",
X year = "January 1987",
X journal = "Conference Record of the 14th Annual ACM Symposium on Principles of Programming Languages",
X pages = "314-345",
X title = "A calculus for assignments in higher-order languages"
X}
X
X@techreport{key71,
X author = "Matthias Felleisen and Daniel P. Friedman",
X address = "Bloomington, Indiana",
X year = "October 1987",
X publisher = "Indiana University",
X title = "A Syntactic Theory of Sequential State"
X}
X
X@article{key72,
X author = "Christopher T. Haynes and Daniel P. Friedman",
X year = "October 1987",
X journal = "ACM Transactions on Programming Languages and Systems",
X number = "4",
X pages = "582-598",
X title = "Embedding continuations in procedural objects",
X volume = "9"
X}
X
X@book{key73,
X author = "Michael Eisenberg",
X address = "Redwood City, CA",
X year = "1988",
X editor = "Harold Abelson",
X publisher = "Scientific Press",
X title = "Programming In Scheme"
X}
X
X@book{key74,
X author = "Mitchell Wand and Daniel P. Friedman",
X booktitle = "Meta-Level Architectures and Reflection",
X year = "1988",
X editor = "P. Maes and D. Nardi",
X publisher = "Elsevier Sci. Publishers B.V. (North Holland)",
X pages = "111-134",
X title = "The Mystery of the Tower Revealed: A Non-Reflective Description of the Reflective Tower"
X}
X
X@book{key75,
X author = "Daniel P. Friedman and Mitchell Wand and Christopher T. Haynes and Eugene E. Kohlbecker",
X year = "1988-1989",
X publisher = "M.I.T. Press and McGraw Hill",
X title = "Programming Languages: Their Abstractions, Representations, and Implementations"
X}
X
X@misc{key76,
X author = "George Springer and Daniel P. Friedman",
X year = "1988-1989",
X title = "An Introduction to the Art of Programming in Scheme"
X}
X
X@article{key77,
X author = "Harold Abelson and Gerald Jay Sussman",
X year = "February 1988",
X journal = "BYTE",
X pages = "207-218",
X title = "Lisp: A Langauge for Stratified Design"
X}
X
X@article{key78,
X author = "William Clinger",
X year = "February 1988",
X journal = "BYTE",
X pages = "221-227",
X title = "Semantics of Scheme"
X}
X
X@article{key79,
X author = "Alan Bawden and Jonathan Rees",
X address = "Salt Lake City, Utah.",
X year = "July 1988",
X journal = "Proceedings of the 1988 ACM Symposium on LISP and Functional Programming",
X title = "Syntactic Closures"
X}
X
X@article{key80,
X author = "Matthias Felleisen and Mitchell Wand and Daniel P. Friedman and Bruce Duba",
X address = "Salt Lake City, Utah.",
X year = "July 1988",
X journal = "Proceedings of the 1988 ACM Symposium on LISP and Functional Programming",
X title = "Abstract Continuations: A Mathematical Semantics for Handling Functional Jumps"
X}
X
X@techreport{key81,
X author = "John Franco and Daniel P. Friedman",
X address = "Bloomington, Indiana",
X year = "March 1988",
X publisher = "Indiana University",
X title = "Creating Efficient Programs by Exchanging Data for Procedures"
X}
X
X@article{key82,
X author = "Mitchell Wand and Daniel P. Friedman",
X year = "241-263 1978",
X journal = "Computer Languages 3",
X title = "Compiling lambda expressions using continuations and factorizations"
X}
X
END_OF_FILE
if test 20265 -ne `wc -c <'scheme.bibtex'`; then
echo shar: \"'scheme.bibtex'\" unpacked with wrong size!
fi
# end of 'scheme.bibtex'
fi
echo shar: End of shell archive.
exit 0
--
Crud that is not paged | Usenet: ...!utzoo!yunexus!oz
is still crud. | ...uunet!mnetor!yunexus!oz
andrew@alice | Bitnet: oz@[yulibra|yuyetti]
| Phonet: +1 416 736-5257x3976gls@THINK.COM (08/23/88)
This is a wonderful resource! Thank you for your efforts. However, there is a bug. I spell my name with no comma before the "Jr.". (Leslie Lamport cites this fact in the LaTeX manual, page 142. Unfortunately his solution to the problem is incorrect. The correct inverted form is "Steele, Guy L., Jr." and not "Steele Jr., Guy L.") --Guy
gls@THINK.COM (08/31/88)
Date: Mon, 29 Aug 88 14:34:39 EDT From: oz@yunexus.arpa (Ozan Yigit) ... Ps: I have ordered a copy of your rabbit report from NTIS. Do you happen to have a machine-readable copy of the compiler + vm ?? No, I'm afraid not. Unless they still exist on old MIT backup tapes, they're gone. --Guy
oz@yunexus.UUCP (Ozan Yigit) (09/03/88)
Notes:
o Scheme Bibliography will probably appear as a section
in Lisp Pointers, titled "Readings In Scheme".
o Noone appears to have any additions to the bibliography,
as I have a total "contributor's silence".
o Well, foo. they missed :-). Four entries were added, as
included at the end of this article, in diff -c format.
[Use patch program to bring your database up-to-date:
in the directory containing scheme.bib: patch <this-article]
[Non-Unix folk, send mail for a copy of the full database
if needed.]
o I Received much mail about the biblio. Nice to see
that it is useful to so many.
o Abstracts needed: If you have any abstracts (or could
put together one) for the entries in the biblio, it
would really be appreciated. Abstracts would make the
bibliography much more useful. [Any takers ??]
o Happy Scheming...
The latest addition to the biblio (included in the diff)
%A Olin Shivers
%T Control Flow Analysis in Scheme
%J Proceedings of the Sigplan 1988 Conterence on Programming Language
Design and Implementation
%P 164-174
%C Atlanta, Georgia
%D June 1988
%K schflow
Abstract:
Traditional flow analysis techniques, such as the ones typically
employed by optimizing Fortran compilers do not work for Scheme-like
languages. This paper presents a flow analysis technique - control flow
analysis - which is applicable to Scheme-like languages.
=============== updates for scheme.bib
*** scheme.bib Fri Sep 2 12:51:53 1988
--- scheme.bib.new Fri Sep 2 12:25:21 1988
***************
*** 35,40 ****
--- 35,41 ----
%P 153-162
%I ACM
%D 1977
+ %K ultimate
%A Guy Lewis Steele, Jr.
%T Macaroni is Better than Spaghetti
***************
*** 43,48 ****
--- 44,50 ----
%P 60-66
%O Special joint issue of SIGPLAN Notices 12(8) and SIGART Newsletter 64
%D August 1977
+ %K macaroni
%A Mitchell Wand
%T Continuation-Based Program Transformation Strategies
***************
*** 52,57 ****
--- 54,68 ----
%P 174-180
%D 1978
+ %A Mitchell Wand
+ %A Daniel P. Friedman
+ %T Compiling lambda expressions using continuations and
+ factorizations
+ %J Journal of Computer Languages
+ %V 3
+ %P 241-263
+ %D 1978
+
%A Guy Lewis Steele, Jr.
%A Gerald Jay Sussman
%T The Revised Report on Scheme, a Dialect of Lisp
***************
*** 58,63 ****
--- 69,75 ----
%R MIT Artificial Intelligence Memo 452
%C Cambridge, Mass.
%D January 1978
+ %K r-report
%A Guy Lewis Steele, Jr.
%T Rabbit: a Compiler for Scheme
***************
*** 64,69 ****
--- 76,82 ----
%R MIT Artificial Intelligence Laboratory Technical Report 474
%C Cambridge, Mass.
%D May 1978
+ %K rabbit
%A Guy Lewis Steele, Jr.
%A Gerald Jay Sussman
***************
*** 74,79 ****
--- 87,99 ----
%D May 1978
%K modularity
+ %A Uwe F. Pleban
+ %T The Standard Semantics of a Subset of SCHEME, a Dialect of LISP
+ %R Computer Science Technical Report TR-79-3
+ %I University of Kansas
+ %C Lawrence, Kansas
+ %D July 1979
+
%A Drew McDermott
%T An Efficient Environment Allocation Scheme in an Interpreter
for a Lexically-Scoped Lisp
***************
*** 91,96 ****
--- 111,124 ----
%I The Lisp Conference, P.O. Box 487, Redwood Estates CA.
%D 1980
+ %A Uwe F. Pleban
+ %T A Denotational Approach to Flow Analysis and Optimization of
+ SCHEME, A Dialect of LISP
+ %R Ph.D. Dissertation
+ %I University of Kansas
+ %C Lawrence, Kansas
+ %D 1980
+
%A Guy Lewis Steele, Jr.
%T Compiler Optimization Based on Viewing LAMBDA as RENAME + GOTO
%B AI: An MIT Perspective
***************
*** 99,104 ****
--- 127,133 ----
%I MIT Press
%C Cambridge, Mass.
%D 1980
+ %K rename+goto
%A Guy Lewis Steele, Jr.
%A Gerald Jay Sussman
***************
*** 107,112 ****
--- 136,142 ----
%P 163-172
%I The Lisp Conference
%D 1980
+ %K lazy
%A Mitchell Wand
%T Continuation-Based Multiprocessing
***************
*** 135,140 ****
--- 165,171 ----
%P 10-21
%D July 1981
%I IEEE
+ %K scheme79
%A John Batali
%A Edmund Goodhue
***************
*** 164,169 ****
--- 195,201 ----
Functional Programming
%P 114-122
%D 1982
+ %K T
%A Gerald Jay Sussman
%T LISP, Programming and Implementation
***************
*** 202,207 ****
--- 234,240 ----
%C Bloomington, Indiana
%D February 1983
%O Superceded by Computer Science Technical Report 153, 1985
+ %K scheme311
%A William Clinger
%T The Scheme 311 compiler: An Exercise in Denotational Semantics
***************
*** 209,215 ****
Functional Programming
%P 356-364
%D 1984
! %K comp311
%A Daniel P. Friedman
%A Christopher T. Haynes
--- 242,248 ----
Functional Programming
%P 356-364
%D 1984
! %K compile311
%A Daniel P. Friedman
%A Christopher T. Haynes
***************
*** 261,276 ****
--- 294,319 ----
%I S. B. Thesis, MIT Department of Electrical Engineering and Computer
Science
%D January 1984
+ %K liar
+ %A Richard Schooler
+ %A James W. Stamos
+ %T Proposal For a Small Scheme Implementation
+ %R MIT Lab for Computer Science Memo TM-267
+ %C Cambridge, Mass.
+ %D October 1984
+
%T MIT Scheme Manual, Seventh Edition
%I Department of Electrical Engineering and Computer Science, MIT
%C Cambridge, Mass.
%D September 1984
+ %K mitscheme
%T MacScheme Reference Manual
%I Semantic Microsystems
%C Sausalito, Calif.
%D 1985
+ %K macscheme
%A Harold Abelson
%A Gerald Jay Sussman
***************
*** 279,285 ****
%I MIT Press
%C Cambridge, Mass.
%D 1985
! %K sicp
%A William Clinger
%A Daniel P. Friedman
--- 322,328 ----
%I MIT Press
%C Cambridge, Mass.
%D 1985
! %K siocp
%A William Clinger
%A Daniel P. Friedman
***************
*** 450,455 ****
--- 493,499 ----
%P 151-161
%D August 1986
%O To appear in Lisp and Symbolic Computation
+ %K hygienic
%A Mitchell Wand
%T The mystery of the tower revealed: a non-reflective
***************
*** 457,462 ****
--- 501,507 ----
%J Proceedings of the 1986 ACM Symposium on LISP and Functional Programming
%P 298-307
%D August 1986
+ %K tower
%E Jonathan A. Rees
%E William Clinger
***************
*** 465,470 ****
--- 510,516 ----
%V 21
%N 12
%D December 1986
+ %K rrrrs
%A Christopher T. Haynes
%T Logic Continuations
***************
*** 544,554 ****
%P 206-223
%D 1987
- %T A syntactic theory of sequential control
%A Matthias Felleisen
%A Daniel P. Friedman
%A Eugene E. Kohlbecker
%A Bruce Duba
%J Theoretical Computer Science
%V 52
%P 205-237
--- 590,600 ----
%P 206-223
%D 1987
%A Matthias Felleisen
%A Daniel P. Friedman
%A Eugene E. Kohlbecker
%A Bruce Duba
+ %T A syntactic theory of sequential control
%J Theoretical Computer Science
%V 52
%P 205-237
***************
*** 571,576 ****
--- 617,623 ----
%P 109-121
%I Pergamon Press
%D 1987
+ %K engines
%A Matthias Felleisen
%T The Calculi of lambda-v-cs conversion: a syntactic
***************
*** 608,616 ****
%C Bloomington, Indiana
%D October 1987
- %T Embedding continuations in procedural objects
%A Christopher T. Haynes
%A Daniel P. Friedman
%J ACM Transactions on Programming Languages and Systems
%V 9
%N 4
--- 655,663 ----
%C Bloomington, Indiana
%D October 1987
%A Christopher T. Haynes
%A Daniel P. Friedman
+ %T Embedding continuations in procedural objects
%J ACM Transactions on Programming Languages and Systems
%V 9
%N 4
***************
*** 671,676 ****
--- 718,724 ----
and Functional Programming
%C Salt Lake City, Utah.
%D July 1988
+ %K macrology
%A Matthias Felleisen
%A Mitchell Wand
***************
*** 683,688 ****
--- 731,745 ----
%C Salt Lake City, Utah.
%D July 1988
+ %A Olin Shivers
+ %T Control Flow Analysis in Scheme
+ %J Proceedings of the Sigplan 1988 Conterence on Programming Language
+ Design and Implementation
+ %P 164-174
+ %C Atlanta, Georgia
+ %D June 1988
+ %K schflow
+
%A John Franco
%A Daniel P. Friedman
%T Creating Efficient Programs by Exchanging Data for Procedures
***************
*** 690,700 ****
%I Indiana University
%C Bloomington, Indiana
%D March 1988
-
- %A Mitchell Wand
- %A Daniel P. Friedman
- %T Compiling lambda expressions using continuations and
- factorizations
- %J Computer Languages 3
- %D 241-263
- %D 1978
--- 747,749 ----
oz
--
Crud that is not paged | Usenet: ...!utzoo!yunexus!oz
is still crud. | ...uunet!mnetor!yunexus!oz
andrew@alice | Bitnet: oz@[yulibra|yuyetti]
| Phonet: +1 416 736-5257x3976oz@yunexus.UUCP (Ozan Yigit) (12/08/88)
Here are few additions to the scheme bibliography since the last posting. I will do a complete re-post at an appropriate time. See LISP POINTERS (Readings in Scheme column) for a printed version. Keep them additions coming. (Thnx Kent!) [For example, I have not yet been able to get the latest Lisp Conf. proceedings... Entries from that conference would be most welcomed.] I have also received some "abstracts", and I will post them with the biblio entries once a critical mass is reached. (Hello Indiana ?? MIT ?? zzzttt...nnn.. can't... hear... you... :-) Help save the scheme-literati: send me the biblio-details of those obscure tech reports dusting(?) on your shelf... If it exists, and has anything to do with Scheme, it ought to be in The (note the uppercase T) Bibliography... Notes: I think (this is a subjective opinion, based on actual reading, and not a commercial :-) Kent's "Three implementation models for Scheme" thesis is an excellent reading, especially for the implementor. It describes the foundations of the `Chez' implementation. I especially enjoyed the clean-and-concise exposition of the ideas and algorithms. Happy scheming... oz ---- snip ---- %A Uwe F. Pleban %T The Standard Semantics of a Subset of SCHEME, a Dialect of LISP %R Computer Science Technical Report TR-79-3 %I University of Kansas %C Lawrence, Kansas %D July 1979 %A Uwe F. Pleban %T A Denotational Approach to Flow Analysis and Optimization of SCHEME, A Dialect of LISP %R Ph.D. Dissertation %I University of Kansas %C Lawrence, Kansas %D 1980 %A Rex A. Dwyer %A R. Kent Dybvig %T A SCHEME for Distributed Processes %R Computer Science Department Technical Report #107 %I Indiana University %C Bloomington, Indiana %D April 1981 %A R. Kent Dybvig %T C-Scheme %R Computer Science Department Technical Report #149 (MS Thesis) %I Indiana University %C Bloomington, Indiana %D 1983 %A Richard Schooler %A James W. Stamos %T Proposal For a Small Scheme Implementation %R MIT Lab for Computer Science Memo TM-267 %C Cambridge, Mass. %D October 1984 %A R. Kent Dybvig %A Bruce T. Smith %T Chez Scheme Reference Manual Version 1.0 %I Cadence Research Systems %C Bloomington, Indiana %D May 1985 %A R. Kent Dybvig %T Three Implementation Models for Scheme %R Department of Computer Science Technical Report #87-011 (PhD Dissertation) %I University of North Carolina at Chapel Hill %C Chapel Hill, North Carolina %D April 1987 %A R. Kent Dybvig %A Robert Hieb %T A Variable-Arity Procedural Interface %J Proceedings of the 1988 ACM Symposium on LISP and Functional Programming %C Salt Lake City, Utah %D July 1988 %P 106-115 %O Also Indiana University Computer Science Department Technical Report #247 %A R. Kent Dybvig %A Robert Hieb %T Engines from Continuations %R Computer Science Department Technical Report #254 %I Indiana University %C Bloomington, Indiana %D July 1988 %O Also to appear in Journal of Computer Languages %A R. Kent Dybvig %A Robert Hieb %T Continuations and Concurrency %R Computer Science Department Technical Report #256 %I Indiana University %C Bloomington, Indiana %D July 1988 %A R. Kent Dybvig %A Daniel P. Friedman %A Christopher T. Haynes %T Expansion-Passing Style: A General Macro Mechanism %J Lisp and Symbolic Computation: An International Journal %V 1 %N 1 %I Kluwer Academic Publishers %P 53-76 %D June 1988 %A Olin Shivers %T Control Flow Analysis in Scheme %J Proceedings of the Sigplan 1988 Conference on Programming Language Design and Implementation %P 164-174 %C Atlanta, Georgia %D June 1988 %K schflow -------------------- -- You see things, and you say "WHY?" Usenet: oz@nexus.yorku.ca But I dream things that never were; ......!uunet!utai!yunexus!oz and say "WHY NOT?" Bitnet: oz@[yulibra|yuyetti] [Back To Methuselah] Bernard Shaw Phonet: +1 416 736-5257x3976
gjc@BUCSF.BU.EDU (George J. Carrette) (12/10/88)
I'm told there is something about a Scheme implementation in the latest Usenix C++ procedings.
pierce@lanai.cs.ucla.edu (Brad Pierce) (09/08/89)
Does anyone know of a current Scheme bibliography? Or even better, does anyone have a bibliography they'd be willing to post to the network? It never hurts to ask! Thanks in advance for any info. -- Brad