Scheme.bib

Friedman:ea:2001
Essentials of Programming Languages
D. P. Friedman, M. Wand, and C. T. Haynes
      (2001)
http://www.cs.indiana.edu/eopl/
Dybvig:1998
Chez Scheme User's Guide
R. K. Dybvig
      (1998)
http://www.scheme.com/csug/
Reynolds:1972
Definitional Interpreters for Higher Order Programming Languages
J. Reynolds
    717-740  (1972)

Dybvig:2003
The Scheme Programming Language
R. K. Dybvig
      (2003)
http://www.scheme.com/tspl3/
Sussman:Steele:1975
Scheme: an Interpreter for Extended Lambda Calculus
G. J. Sussman and G. L. S. Jr.
      (1975)

Steele:Sussman:1976
Lambda, the Ultimate Imperative
G. L. S. Jr. and G. J. Sussman
      (1976)

Friedman:Felleisen:1995
The Little Schemer
D. P. Friedman and M. Felleisen
      (1995)
http://www.ccs.neu.edu/home/matthias/BTLS/
Friedman:Felleisen:1995
The Seasoned Schemer
D. P. Friedman and M. Felleisen
      (1995)
http://www.ccs.neu.edu/home/matthias/BTSS/
Steele:1976
Lambda, the Ultimate Declarative
G. L. S. Jr.
      (1976)

Steele:1977
Debunking the ``Expensive Procedure Call'' Myth, Or Procedure Call Implementations Considered Harmful, Or LAMBDA, the Ultimate GOTO
G. L. S. Jr.
    153-162  (1977)

Felleisen:ea:2001
How to Design Programs: An Introduction to Computing and Programming
M. Felleisen, R. B. Findler, M. Flatt, and S. Krishnamurthi
      (2001)
http://www.htdp.org/2003-09-26/Book/
Steele:1977
Macaroni is Better Than Spaghetti
G. L. S. Jr.
    60-66  (1977)

Abelson:ea:1998
Revised$^5$ Report on the Algorithmic Language Scheme
H. Abelson, R. K. Dybvig, C. T. Haynes, G. J. Rozas, N. I. A. IV, D. P. Friedman, E. Kohlbecker, G. L. S. Jr., D. H. Bartley, R. Halstead, D. Oxley, G. J. Sussman, G. Brooks, C. Hanson, K. M. Pitman, and M. Wand
Higher-Order and Symbolic Computation  11  7-105  (1998)
http://www.schemers.org/Documents/Standards/R5RS/HTML/
Kelsey:ea:1998b
Revised$^5$ Report on the Algorithmic Language Scheme
R. Kelsey, W. Clinger, and J. A. Rees
ACM SIGPLAN Notices  33    (1998)
http://www.schemers.org/Documents/Standards/R5RS/HTML/
Wand:1980b
Continuation-Based Program Transformation Strategies
M. Wand
Journal of the ACM  27  164-180  (1980)

Wand:Friedman:1978
Compiling Lambda Expressions Using Continuations and Factorizations
M. Wand and D. P. Friedman
Journal of Computer Languages  3  241-263  (1978)

Steele:Sussman:1978
The Revised Report on Scheme, a Dialect of Lisp
G. L. S. Jr. and G. J. Sussman
      (1978)

Steele:1978
Rabbit: a Compiler for Scheme
G. L. S. Jr.
      (1978)

Steele:Sussman:1978
The Art of the Interpreter, Or the Modularity Complex (Parts Zero, One, and Two)
G. L. S. Jr. and G. J. Sussman
      (1978)

Stwwle:Sussman:1979
Design of LISP-Based Processors Or, SCHEME: a Dielectric LISP Or, Finite Memories Considered Harmful Or, LAMBDA: the Ultimate Opcode
G. L. S. Jr. and G. J. Sussman
      (1979)

Pleban:1979
The Standard Semantics of a Subset of SCHEME, a Dialect of LISP
U. F. Pleban
      (1979)

Steele:1980
Compiler Optimization Based on Viewing LAMBDA As RENAME + GOTO
G. L. S. Jr.
      (1980)

Steele:Sussman:1980
The Dream of a Lifetime: a Lazy Variable Extent Mechanism
G. L. S. Jr. and G. J. Sussman
    163-172  (1980)

McDermott:1980
An Efficient Environment Allocation Scheme in an Interpreter for a Lexically-Scoped Lisp
D. McDermott
    154-162  (1980)

Muchnick:Pleban:1980
A Semantic Comparison of Lisp and Scheme
S. S. Muchnick and U. F. Pleban
    56-65  (1980)

Pleban:1980
A Denotational Approach to Flow Analysis and Optimization of SCHEME, a Dialect of LISP
U. F. Pleban
      (1980)

Wand:1980
Continuation-Based Multiprocessing
M. Wand
    19-28  (1980)

Wand:1980
Scheme Version 3.1 Reference Manual
M. Wand
      (1980)

Steele:Sussman:1980
Design of a Lisp-Based Processor
G. L. S. Jr. and G. J. Sussman
CACM  23  628-645  (1980)

Dwyer:Dybvig:1981
A SCHEME for Distributed Processes
R. A. Dwyer and R. K. Dybvig
      (1981)

Sussman:ea:1981
Scheme-79 - Lisp on a Chip
G. J. Sussman, J. Holloway, G. L. S. Jr., and A. Bell
IEEE Computer  14  10-21  (1981)

Batali:ea:1982
The Scheme-81 Architecture - System and Chip
J. Batali, E. Goodhue, C. Hanson, H. Shrobe, R. M. Stallman, and G. J. Sussman
    69-77  (1982)

Rees:Adams:1982
T: a Dialect of Lisp Or, LAMBDA: the Ultimate Software Tool
J. A. Rees and N. I. Adams
    114-122  (1982)

Sussman:1982
Lisp, Programming and Implementation
G. J. Sussman
      (1982)

Dybvig:1983
C-Scheme
R. K. Dybvig
      (1983)

Chen:ea:1983
Scheme Graphics Reference Manual
P. H. Chen, W. Y. Chi, E. M. Ost, L. D. Sabbagh, and G. Springer
      (1983)

Chen:Friedman:1983
Prototyping Data Flow by Translation Into Scheme
P. H. Chen and D. P. Friedman
      (1983)

Fessenden:ea:1983
Scheme 311 Version 4 Reference Manual
C. Fessenden, W. Clinger, D. P. Friedman, and C. T. Haynes
      (1983)

Clinger:1984
The Scheme 311 Compiler: an Exercise in Denotational Semantics
W. Clinger
    356-364  (1984)

Friedman:ea:1984
Programming with Continuations
D. P. Friedman, C. T. Haynes, and E. E. Kohlbecker
    263-274  (1984)

Haynes:Friedman:1984
Engines Build Process Abstractions
C. T. Haynes and D. P. Friedman
    18-24  (1984)

Haynes:ea:1984
Continuations and Coroutines
C. T. Haynes, D. P. Friedman, and M. Wand
    293-298  (1984)

Friedman:Wand:1984
Reification: Reflection Without Metaphysics
D. P. Friedman and M. Wand
    348-355  (1984)

Rees:ea:1984
The T Manual, Fourth Edition
J. A. Rees, N. I. Adams, and J. R. Meehan
      (1984)

Rozas:1984
Liar, an Algol-Like Compiler for Scheme
G. J. Rozas
      (1984)

Schooler:Stamos:1984
Proposal for a Small Scheme Implementation
R. Schooler and J. W. Stamos
      (1984)

84Mit
Mit Scheme Manual, Seventh Edition

      (1984)

85Macscheme
Macscheme Reference Manual

      (1985)

Abelson:ea:1985
Structure and Interpretation of Computer Programs
H. Abelson, G. J. Sussman, and J. Sussman
      (1985)

Clinger:ea:1985
A Scheme for a Higher-Level Semantic Algebra
W. Clinger, D. P. Friedman, and M. Wand
    237-250  (1985)

Srivastava:ea:1985
An (Other) Integration of Logic and Functional Programming
A. Srivastava, D. Oxley, and A. Srivastava
    254-260  (1985)

85Revised
The Revised Revised Report on Scheme, Or an Uncommon Lisp

      (1985)

Friedman:Haynes:1985
Constraining Control
D. P. Friedman and C. T. Haynes
    245-254  (1985)

Friedman:ea:1985
Scheme 84 Interim Reference Manual
D. P. Friedman, C. T. Haynes, E. E. Kohlbecker, and M. Wand
      (1985)

Chen:Sabbagh:1985
Scheme As an Interactive Graphics Programming Environment
P. Chen and L. D. Sabbagh
      (1985)

Dybvig:Smith:1985
Chez Scheme Reference Manual Version 1.0
R. K. Dybvig and B. T. Smith
      (1985)

85Ti
Ti Scheme Language Reference Manual

      (1985)

Eisenberg:1985
Bochser: an Integrated Scheme Programming System
M. A. Eisenberg
      (1985)

Felleisen:1985
Transliterating Prolog Into Scheme
M. Felleisen
      (1985)

Bartley:Jensen:1986
The Implementation of PC Scheme
D. H. Bartley and J. C. Jensen
    86-93  (1986)

Dybvig:ea:1986
Expansion-Passing Style: Beyond Conventional Macros
R. K. Dybvig, D. P. Friedman, and C. T. Haynes
    143-150  (1986)

Feeley:LaPalme:1986
Closure Generation Based on Viewing LAMBDA As EPSILON Plus COMPILE
M. Feeley and G. LaPalme
      (1986)

Felleisen:Friedman:1986
A Closer Look at Export and Import Statements
M. Felleisen and D. P. Friedman
Journal of Computer Languages  11  29-37  (1986)

Friedman:Felleisen:1986
The Little LISPer: Second Edition
D. P. Friedman and M. Felleisen
      (1986)

Haynes:ea:1986
Obtaining Coroutines with Continuations
C. T. Haynes, D. P. Friedman, and M. Wand
Journal of Computer Languages  11  143-153  (1986)

Wand:1986
Finding the Source of Type Errors
M. Wand
    38-43  (1986)

Wand:1986
From Interpreter to Compiler: a Representational Derivation
M. Wand
      (1986)

Felleisen:Friedman:1986a
Control Operators, the SECD-Machine, and the Lambda-Calculus
M. Felleisen and D. P. Friedman
    193-219  (1986)

Kohlbecker:1986
Syntactic Extensions in the Programming Language Lisp
E. E. Kohlbecker
      (1986)

Kohlbecker:ea:1986
Hygienic Macro Expansion
E. E. Kohlbecker, D. P. Friedman, M. Felleisen, and B. Duba
Symposium on LISP and Functional Programming    151-161  (1986)

Wand:1986
The Mystery of the Tower Revealed: a Non-Reflective Description of the Reflective Tower
M. Wand
    298-307  (1986)

86Revised
Revised$^3$ Report on the Algorithmic Language Scheme

ACM Sigplan Notices  21    (1986)

Haynes:1986
Logic Continuations
C. T. Haynes
    671-685  (1986)

Felleisen:ea:1986
Reasoning with Continuations
M. Felleisen, D. P. Friedman, E. E. Kohlbecker, and B. Duba
    131-141  (1986)

Kranz:ea:1986
Orbit: an Optimizing Compiler for Scheme
D. Kranz, R. Kelsey, J. A. Rees, P. Hudak, J. Philbin, and N. I. Adams
    219-233  (1986)

Feeley:1986
Deux Approches a' L'Implantation Du Language Scheme
M. Feeley
      (1986)

Lang:Pearlmutter:1986
Oaklisp: an Object-Oriented Scheme with First Class Types
K. J. Lang and B. A. Pearlmutter
    30-37  (1986)

Clinger:1987
The Scheme of Things: Streams Versus Generators
W. Clinger
      (1987)

Dybvig:1987
The Scheme Programming Language
R. K. Dybvig
      (1987)

Feeley:LaPalme:1987
Using Closures for Code Generation
M. Feeley and G. LaPalme
Journal of Computer Languages  12  47-66  (1987)

Felleisen:1987
Reflections on Landin'S J-Operator: a Partly Historical Note
M. Felleisen
Journal of Computer Languages  12  197-207  (1987)

Felleisen:Friedman:1987
A Reduction Semantics for Imperative Higher-Order Languages
M. Felleisen and D. P. Friedman
Parallel Architectures and Languages Europe  259  206-223  (1987)

Felleisen:ea:1987
A Syntactic Theory of Sequential Control
M. Felleisen, D. P. Friedman, E. E. Kohlbecker, and B. Duba
Theoretical Computer Science  52  205-237  (1987)

Friedman:Felleisen:1987
The Little LISPer
D. P. Friedman and M. Felleisen
      (1987)

Haynes:Friedman:1987
Abstracting Timed Preemption with Engines
C. T. Haynes and D. P. Friedman
Journal of Computer Languages  12  109-121  (1987)

Slade:1987
The T Programming Language
S. Slade
      (1987)

Duba:ea:1987
Dynamic Identifiers Can Be Neat
B. F. Duba, M. Felleisen, and D. P. Friedman
      (1987)

Dybvig:1987a
Three Implementation Models for Scheme
R. K. Dybvig
      (1987)

Felleisen:1987a
The Calculi of Lambda-V-CS Conversion: a Syntactic Theory of Control and State in Imperative Higher-Order Programming Languages
M. Felleisen
      (1987)

Miller:1987
A Parallel Processing System Based on MIT Scheme
J. S. Miller
      (1987)

Felleisen:ea:1987
Beyond Continuations
M. Felleisen, D. P. Friedman, B. Duba, and J. Merrill
      (1987)

Kohlbecker:Wand:1987
Macro-by-Example: Deriving Syntactic Transformations From Their Specifications
E. E. Kohlbecker and M. Wand
    77-84  (1987)

Felleisen:Friedman:1987a
A Calculus for Assignments in Higher-Order Languages
M. Felleisen and D. P. Friedman
    314-345  (1987)

Felleisen:Friedman:1987
A Syntactic Theory of Sequential State
M. Felleisen and D. P. Friedman
      (1987)

Haynes:Friedman:1987
Embedding Continuations in Procedural Objects
C. T. Haynes and D. P. Friedman
ACM Transactions on Programming Languages and Systems  9  582-598  (1987)

Eisenberg:1988
Programming in Scheme
M. Eisenberg
      (1988)

Kranz:1988
Orbit: an Optimizing Compiler for Scheme
D. Kranz
      (1988)

Wand:Friedman:1988
The Mystery of the Tower Revealed: a Non-Reflective Description of the Reflective Tower
M. Wand and D. P. Friedman
    111-134  (1988)

Adams:Rees:1988
Object-Oriented Programming in Scheme
N. Adams and J. Rees
    277-288  (1988)

Clinger:ea:1988
Implementation Strategies for Continuations
W. D. Clinger, A. H. Hartheimer, and E. M. Ost
    124 131  (1988)

Felleisen:1988
$\lambda_{V-CS}$: an Extended $\lambda$-Calculus for Scheme
M. Felleisen
    72-85  (1988)

Abelson:Sussman:1988
Lisp: a Language for Stratified Design
H. Abelson and G. J. Sussman
BYTE    207-218  (1988)

Clinger:1988
Semantics of Scheme
W. Clinger
BYTE    221-227  (1988)

Bawden:Rees:1988
Syntactic Closures
A. Bawden and J. Rees
      (1988)

Dybvig:Hieb:1988
A Variable-Arity Procedural Interface
R. K. Dybvig and R. Hieb
    106-115  (1988)

Felleisen:ea:1988
Abstract Continuations: a Mathematical Semantics for Handling Functional Jumps
M. Felleisen, M. Wand, D. P. Friedman, and B. Duba
      (1988)

Dybvig:ea:1988
Expansion-Passing Style: a General Macro Mechanism
R. K. Dybvig, D. P. Friedman, and C. T. Haynes
Lisp and Symbolic Computation: An International Journal  1  53-76  (1988)

Shivers:1988
Control Flow Analysis in Scheme
O. Shivers
    164-174  (1988)

Franco:Friedman:1988
Creating Efficient Programs by Exchanging Data for Procedures
J. Franco and D. P. Friedman
      (1988)

Lang:Pearlmutter:1988
Oaklisp: an Object-Oriented Dialect of Scheme
K. J. Lang and B. A. Pearlmutter
Lisp and Symbolic Computation: An International Journal  1  39-51  (1988)

Shivers:1988
The Semantics of Scheme Control Flow Analysis (Preliminary).
O. Shivers
      (1988)

Dybvig:Hieb:1989
Engines From Continuations
R. K. Dybvig and R. Hieb
Journal of Computer Languages  14  109-123  (1989)

Springer:Friedman:1989
Scheme and the Art of Programming
G. Springer and D. P. Friedman
      (1989)

Felleisen:Hieb:1989
The Revised Report on the Syntactic Theories of Sequential Control and State.
M. Felleisen and R. Hieb
      (1989)

Vegdahl:Pleban:1989
The Runtime Environment for Screme, a Scheme Implementation on the 88000
S. R. Vegdahl and U. F. Pleban
    172-182  (1989)

Bartlett:1989
{S}cheme-$>$C a Portable Scheme-to-C Compiler
J. F. Bartlett
      (1989)

Ashley:Salter:1989
A Revised State Space Model for a Logic Programming Embedding in Scheme
J. M. Ashley and R. M. Salter
      (1989)

Danvy:1989
Programming with Tighter Control
O. Danvy
      (1989)

Danvy:1989a
Combiner Logiquement En Scheme
O. Danvy
      (1989)

Delacour:1989
Picolo Expresso
V. Delacour
      (1989)

Deutsch:ea:1989
Cskim: an Extended Dialect of Scheme
A. Deutsch, R. Dumeur, C. Consel, and J. Fekete
      (1989)

Kaplan:Loyall:1989
Garp/Scheme: Implementing a Concurrent, Object-Based Language
S. M. Kaplan and J. P. Loyall
      (1989)

Kim:Zeigler:1989
The DEVS-Scheme Modelling and Simulation Environment
T. G. Kim and B. P. Zeigler
      (1989)

Lapalme:Feeley:1989
Micro-Scheme
G. Lapalme and M. Feeley
      (1989)

Lawall:Friedman:1989
Embedding the Self Language in Scheme
J. L. Lawall and D. P. Friedman
      (1989)

Pic:Briand:1989
Visual Programming with Generators
A. Pic and M. Briand
      (1989)

Queinnec:1989
Validation Suite Generation
C. Queinnec
      (1989)

Royer:ea:1989
Le Modèle OBJScheme: Principes Et Applications
J. C. Royer, J. P. Braquelaire, P. Casteran, M. Desainte-Catherine, and J. G. Penaud
      (1989)

Strandh:1989
Oooz, a Multi-User Programming Environment Based on Scheme
R. Strandh
      (1989)

Seniak:1989
Compilation De Scheme Par Spécialisation Explicite
N. Séniak
      (1989)

Ulrich:1989
Enumeration Algorithms and Non-Deterministic Programming in Scheme
J. W. Ulrich
      (1989)

Rees:1989
Modular Macros
J. Rees
      (1989)

Harrison:1989
The Interprocedural Analysis and Automatic Parallellization of Scheme Programs
W. L. H. III
Lisp and Symbolic Computation: An International Journal  2    (1989)

Eisenberg:ea:1990
Programming in Macscheme
M. Eisenberg, W. Clinger, and A. Hartheimer
      (1990)

Franco:Friedman:1990
Towards a Facility for Lexically Scoped, Dynamic Mutual Recursion in Scheme
J. Franco and D. P. Friedman
Journal of Computer Languages  15  55-64  (1990)

Franco:ea:1990
Multi-Way Streams in Scheme
J. Franco, D. P. Friedman, and S. Johnson
Journal of Computer Languages  15  109-125  (1990)

Kamin:1990
Programming Languages: an Interpreter-Based Approach
S. Kamin
      (1990)

Normark:1990
Simulation of Object-Oriented Concepts and Mechanisms in Scheme
K. Normark
      (1990)

Sitaram:Felleisen:1990
Control Delimiters and Their Hierarchies
D. Sitaram and M. Felleisen
Lisp and Symbolic Computation: An International Journal  3  67-99  (1990)

Curtis:Rauen:1990
A Module System for Scheme
P. Curtis and J. Rauen
      (1990)

Feeley:Miller:1990
A Parallel Virtual Machine for Efficient Scheme Compilation
M. Feeley and J. S. Miller
      (1990)

Hanson:1990
Efficient Stack Allocation for Tail-Recursive Languages
C. Hanson
      (1990)

Hieb:ea:1990
Representing Control in the Presence of First-Class Continuations
R. Hieb, R. K. Dybvig, and C. Bruggeman
    66-77  (1990)

Katz:Weise:1990
Continuing Into the Future: on the Interaction of Futures and First-Class Continuations
M. Katz and D. Weise
      (1990)

Teodosiu:1990
Hare: a Compiler for Scheme
D. Teodosiu
      (1990)

Bonzon:1990
A Metacircular Evaluator for a Logical Extension of Scheme
P. Bonzon
Lisp and Symbolic Computation: An International Journal  3  113-133  (1990)

Dybvig:Hieb:1990
Continuations and Concurrency
R. K. Dybvig and R. Hieb
    128-136  (1990)

Shivers:1990
Data-Flow Analysis and Type Recovery in Scheme.
O. Shivers
      (1990)

Dybvig:Hieb:1990a
A New Approach to Procedures with Variable Arity
R. K. Dybvig and R. Hieb
Lisp and Symbolic Computation: An International Journal  3  229-244  (1990)

199091Ieee
Ieee Standard for the Scheme Programming Language
I. S. 1178-1990
      (1991)

Forin:1991
Futures
A. Forin
      (1991)

Rozas:Miller:1991
Free Variables and First-Class Environments
G. Rozas and J. Miller
Lisp and Symbolic Computation: An International Journal  3  107-141  (1991)

Pearlmutter:Lang:1991
The Implementation of Oaklisp
B. A. Pearlmutter and K. J. Lang
      (1991)

Pleban:1991
Compilation Issues in the Screme Implementation for the 88000
U. F. Pleban
      (1991)

Shivers:1991
Data-Flow Analysis and Type Recovery in Scheme
O. Shivers
      (1991)

Sitaram:Felleisen:1991
Modeling Continuations Without Continuations
D. Sitaram and M. Felleisen
    185-196  (1991)

Beckman:1991
A Scheme for Little Languages in Interactive Graphics
B. Beckman
Software-Practice and Experience  21  187-207  (1991)

Teodosiu:1991
Hare: an Optimizing Portable Compiler for Scheme
D. Teodosiu
ACM Sigplan Notices  26    (1991)

Clinger:1991
Hygenic Macros Through Explicit Renaming
W. Clinger
Lisp Pointers  IV  17-23  (1991)

Clinger:1991a
Macros in Scheme
W. Clinger
Lisp Pointers  IV  25-28  (1991)

Hanson:1991
A Syntactic Closures Macro Facility
C. Hanson
Lisp Pointers  IV  9-16  (1991)

Friedman:ea:1992
Essentials of Programming Languages
D. P. Friedman, M. Wand, and C. T. Haynes
      (1992)

Ramsdell:1992
An Operational Semantics for Scheme
J. D. Ramsdell
Lisp Pointers  V    (1992)

Lawall:Friedman:1992
Toward Leakage Containment
J. L. Lawall and D. P. Friedman
      (1992)

Jagannathan:Philbin:1992
A Customizable Substrate for Concurrent Languages
S. Jagannathan and J. Philbin
      (1992)

Bondorf:1992
Improving Binding Times Without Explicit CPS-Conversion
A. Bondorf
    1-10  (1992)

Danvy:Lawall:1992
Back to Direct Style II: First-Class Continuations
O. Danvy and J. L. Lawall
    299-310  (1992)

Dickey:1992
The Scheme Programming Language
K. Dickey
Computer Language      (1992)

Dybvig:1992
Writing Hygenic Macros in Scheme with Syntax-Case
K. Dybvig
      (1992)

Henglein:1992
Global Tagging Optimization by Type Inference
F. Henglein
    205-215  (1992)

Hieb:ea:1992
Syntactic Abstraction in Scheme
R. Hieb, K. Dybvig, and C. Bruggeman
      (1992)

Jagannathan:Philbin:1992
A Foundation for an Efficient Multi-Threaded Scheme System
S. Jagannathan and J. Philbin
    345-357  (1992)

Rose:Muller:1992
Integrating the Scheme and C Languages
J. H. Rose and H. Muller
    247-259  (1992)

Rozas:1992
Taming the Y Operator
G. Rozas
    226-234  (1992)

Sabry:Felleisen:1992
Reasoning About Programs in Continuation-Passing Style
A. Sabry and M. Felleisen
    288-298  (1992)

Tung:1992
Interactive Modular Programming in Scheme
S. S. Tung
    86-95  (1992)

Freeman:Friedman:1992
Characterizing the Paralation Model Using Dynamic Assignment
E. T. Freeman and D. P. Friedman
      (1992)

Lee:Friedman:1992
First-Class Extents
S. Lee and D. P. Friedman
      (1992)

Tung:1992
Merging Interactive, Modular and Object-Oriented Programming
S. S. Tung
      (1992)

Rees:Donald:1992
Program Mobile Robots in Scheme
J. Rees and B. Donald
    2681-2688  (1992)