Bibliography

AAL88

John Ellis Andrew Appel and Kai Lai.
Real-time concurrent collection on stock multiprocessors.
In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 11-20, June 1988.

AG94

George S. Almasi and Allan Gottlieb.
Highly Parallel Computing.
Benjamin/Cummings, 1994.

AL91

Andrew Appel and Kai Lai.
Virtual memory primitives for user programs.
In ACM Architectural Support for Programming Languages and Operating Systems, pages 96-107, April 1991.

BH77

Henry C. Baker and Carl Hewitt.
The incremental garbage collection of processes.
ACM SIGPLAN Notices, 12(8):55-59, August 1977.

Bur84

F. Warren Burton.
Annotations to control parallelism and reduction order in the distributed evaluation of functional programs.
ACM Transactions on Programming Languages and Systems, 6(2):159-174, April 1984.

Bur85a

F. Warren Burton.
Controlling speculative computation in a parallel functional programming language.
In IEEE International Conference on Distributed Computing Systems, pages 453-457, May 1985.

Bur85b

F. Warren Burton.
Speculative computation, parallelism and functional programming.
ACM Transactions on Programming Languages and Systems, c-34(12):1190-1193, December 1985.

CJR91

William Clinger and Eds. Jonathan Rees.
Revised4 report on the algorithmic language scheme.
Technical report, Indiana University, November 1991.
Technical Report No. 341.

DAKM89

Jr. David A. Kranz, Robert H. Halstead and Eric Mohr.
Mul-t: A high-performance parallel lisp.
In ACM Symposium on Programming Language Design and Implementation, pages 81-90, 1989.

DW94

et. al. D.S. Wise.
Uniprocessor performance of reference-counting hardware heap.
Technical Report 401, Indiana University Computer Science Department, Bloomington, Indiana, June 1994.

FM90

Marc Feeley and James S. Miller.
A parallel virtual scheme machine for efficient scheme compilation.
In ACM Conference on Lisp and Functional Programming, pages 119-130, 1990.

FW76a

Daniel P. Friedman and David S. Wise.
CONS should not evaluate its arguments.
In S. Michaelson and R. Milner, editors, Automata, Languages and Programming, pages 257-284. Edinburgh University Press, Edinburgh, 1976.

FW76b

Daniel P. Friedman and David S. Wise.
The impact of applicative programming on multiprocessing.
In International Conference on Parallel Processing, pages 263-272. IEEE, 1976.
IEEE Cat. No. 76CH1127-OC.

FW76c

Daniel P. Friedman and David S. Wise.
Output driven interpretation of recursive programs, or writing creates and destroys data structures.
Information Processing Letters 5, pages 155-160, December 1976.

FW77

Daniel P. Friedman and David S. Wise.
An environment for multiple-valued recursive procedures.
In B. Robinet, editor, Programmation, pages 182-200. Dunod Informatique, Paris, 1977.

FW78a

Daniel P. Friedman and David S. Wise.
Applicative multiprogramming.
Technical Report 72, Indiana University Computer Science Department, Bloomington, Indiana, 1978.
Revised: December, 1978.

FW78b

Daniel P. Friedman and David S. Wise.
Aspects of applicative programming for parallel processing.
IEEE Trans. Comput. C-27, 4, pages 289-296, April 1978.

FW78c

Daniel P. Friedman and David S. Wise.
Functional combination.
Computer Languages 3, 1, pages 31-35, 1978.

FW78d

Daniel P. Friedman and David S. Wise.
Sting-unless: a conditional, interlock-free store instruction.
In M. B. Pursley and Jr. J. B. Cruz, editors, 16th Annual Allerton Conf. on Communication, Control, and Computing, University of Illinois (Urbana-Champaign), pages 578-584, 1978.

FW78e

Daniel P. Friedman and David S. Wise.
Unbounded computational structures.
Software-Practice and Experience 8, 4, pages 407-416, July-August 1978.

FW79

Daniel P. Friedman and David S. Wise.
An approach to fair applicative multiprogramming.
In G. Kahn and R. Milner, editors, Semantics of Concurrent Computation, pages 203-225. Berlin, Springer, 1979.

FW80a

Daniel P. Friedman and David S. Wise.
A conditional, interlock-free store instruction.
Technical Report 74, Indiana University Computer Science Department, Bloomington, Indiana, 1980.
(revised 1980).

FW80b

Daniel P. Friedman and David S. Wise.
An indeterminate constructor for applicative multiprogramming.
In Record 7th ACM Symp. on Principles of Programming Languages (January, 1980), pages 245-250, 1980.

FW81

Daniel P. Friedman and David S. Wise.
Fancy ferns require little care.
In S. Holmstrom, B. Nordstrom, and A. Wikstrom, editors, Symp. on Functional Languages and Computer Architecture, Lab for Programming Methodology, Goteborg, Sweden, 1981.

GG88

Ron Goldman and Richard P. Gabriel.
Preliminary results with the initial implementation of qlisp.
In ACM Symposium on Lisp and Functional Programming, pages 143-152, July 1988.

GM84

Richard P. Gabriel and John McCarthy.
Queue-based multi-processing lisp.
In ACM Symposium on Lisp and Functional Programming, pages 25-43, August 1984.

GP81

Dale H. Grit and Rex L. Page.
Deleting irrelevant tasks in an expression-oriented multiprocessor system.
ACM Transactions on Programming Languages and Systems, 3(1):49-59, January 1981.

Hal87

Cordelia Hall.
Strictness analysis applied to programs with lazy list constructors.
PhD thesis, Indiana University Computer Science Department, 1987.

Hem85

David Hemmendinger.
Lazy evaluation and cancellation of computations.
In IEEE International Conference on Parallel Processing, pages 840-842, August 1985.

HJBS91

Alan J. Demers Hans-J. Boehm and Scott Shenker.
Mostly parallel garbage collection.
In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 157-175, June 1991.

HS86

Paul Hudak and L. Smith.
Para-functional programming: a paradigm for programming multiprocessor systems.
In ACM Symposium on Principles of Programming Languages, pages 243-254, January 1986.

HS88

Paul Hudak and Raman S. Sundaresh.
On the expressiveness of purely functional i/o systems.
Technical report, Yale, December 1988.
Yale Technical Report YALEU/DCS/RR-665.

Hud86

Paul Hudak.
Para-functional programming.
Computer, 19(8):60-71, August 1986.

Hud89

Paul Hudak.
Conception, evolution, and application of functional programming languages.
ACM Computing Surveys, 21(3):359-411, September 1989.

HW87

Cordelia Hall and David S. Wise.
Compiling strictness into streams.
In Fourteenth Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, Munich, West Germany, January 21-23, pages 132-143, 1987.

HW92

Brian C. Heck and David S. Wise.
An implementation of an applicative file system.
In Y. Bekkers and J. Cohen, editors, Memory Management, pages 248-263. Lecture Notes in Computer Science 637, Springer-Verlag, 1992.

JB88

Steven D. Johnson and C. David Boyer.
Modeling transistors applicatively.
In Jr. George J. Milne, editor, Fusion of Hardware Design and Verification. North-Holland, 1988.
(Proceedings of the IFIP WG10.2 working conference on formal aspects of VLSI, Strathclyde University, Glasgow, July, 1988).

JBB87

Steven D. Johnson, Bhaskar Bose, and C. David Boyer.
A tactical framework for digital design.
In Graham Birtwistle and P. A. Subramanyam, editors, VLSI Specification, Verification and Synthesis, pages 349-384. Kluwer Academic Publishers, 1987.
Proceedings of the 1987 Calgary Hardware Verification Workshop.

Jes

Eric R. Jeschke.
Dsi assembler reference manual.
(draft, unpublished).

JK81

Steven D. Johnson and Anne T. Kohlstaedt.
Dsi program description.
Technical Report 120, Indiana University Computer Science Department, Bloomington, Indiana, 1981.

Joh77

Steven D. Johnson.
An interpretive model for a language based on suspended construction.
Master's thesis, Indiana University Computer Science Department, 1977.

Joh81

Steven D. Johnson.
Connection networks for output-driven list multiprocessing.
Technical Report 114, Indiana University Computer Science Department, Bloomington, Indiana, 1981.

Joh83

Steven D. Johnson.
Circuits and systems: Implementing communication with streams.
IMACS Transactions on Scientific Computation, Vol. II, pages 311-319, 1983.

Joh84a

Steven D. Johnson.
Applicative programming and digital design.
In Eleventh Annual ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pages 218-227, January 1984.

Joh84b

Steven D. Johnson.
Synthesis of Digital Designs from Recursion Equations.
The ACM Distinguished Dissertation Series, The MIT Press, Cambridge, MA, 1984.

Joh85

Steven D. Johnson.
Storage allocation for list multiprocessing.
Technical Report 168, Indiana University Computer Science Department, Bloomington, Indiana, March 1985.

Joh86

Steven D. Johnson.
Digital design in a functional calculus.
In G. J. Milne and P. A. Subrahmanyam, editors, Workshop on Formal Aspects of VLSI Design (Proceedings of the Workshop on VLSI, Edinburgh), 1985. North-Holland, Amsterdam, 1986.

Joh89a

Steven D. Johnson.
Daisy, dsi, and limp: architectural implications of suspending construction.
Technical report, Indiana University Computer Science Department, Bloomington, Indiana, 1989.

Joh89b

Steven D. Johnson.
Daisy Programming Manual.
Indiana University Computer Science Department, Bloomington, Indiana, second edition, 1989.
(draft in progress, available by request).

Joh89c

Steven D. Johnson.
How daisy is lazy.
Technical report, Indiana University Computer Science Department, Bloomington, Indiana, 1989.

Joh90

Douglas Johnson.
Trap architectures for lisp systems.
In ACM Conference on Lisp and Functional Programming, pages 79-86, 1990.

Jon87

Simon L. Peyton Jones.
The Implementation of Functional Programming Languages.
Prentice-Hall, 1987.

JP92a

Suresh Jagannathan and Jim Philbin.
A customizable substrate for concurrent languages.
In ACM SIGPLAN Conference on Programming Language Design and Implementation, pages 55-67, 1992.

JP92b

Suresh Jagannathan and Jim Philbin.
A foundation for an efficient multi-threaded scheme system.
In ACM Conference on Lisp and Functional Programming, pages 345-355, 1992.

Kie86

Richard B. Kieburtz.
Incremental collection of dynamic, list-structure memories.
Technical report, Oregon Graduate Center, January 1986.
Technical Report CS/E-85-008.

Koh81

Anne T. Kohlstaedt.
Daisy 1.0 reference manual.
Technical Report 119, Indiana University Computer Science Department, Bloomington, Indiana, 1981.
([Joh89a] should be delivered implicitly).

KS88

L.V. Kale and Wennie Shu.
The chare-kernel language for parallel programming: A perspective.
Technical report, University of Illinois, August 1988.

KW90

Morry Katz and Daniel Weisse.
Continuing into the future: On the interaction of futures and first-class continuations.
In ACM Conference on Lisp and Functional Programming, pages 176-184, 1990.

Lar91

James R. Larus.
Compiling lisp programs for parallel execution.
Lisp and Symbolic Computation, 4:29-99, 1991.

LD88

Yue-Sheng Liu and Susan Dickey.
Simulation and analysis of different switch architectures for interconnection networks in mimd shared memory machines.
Technical report, Courant Institute of Mathematical Sciences, June 1988.
Ultracomputer Note #141.

Liv88

Brian K. Livesey.
The aspen distributed stream processing environment.
Technical report, UCLA, December 1988.
UCLA Technical Report CSD-880102.

Mil87

James S. Miller.
Multischeme: A Parallel Processing System based on MIT Scheme.
PhD thesis, September 1987.
Also available as MIT Technical Report MIT/LCS/TR-402.

Moh90

Eric et. al. Mohr.
Lazy task creation: A technique for increasing the granularity of parallel programs.
In ACM Conference on Lisp and Functional Programming, pages 185-197, 1990.

Moo84

David Moon.
Garbage collection in a large lisp system.
In ACM Conference on Lisp and Functional Programming, pages 235-346, August 1984.

MRSL88

Robert R. Kessler Mark R. Swanson and Gary Lindstrom.
An implementation of portable standard lisp on the bbn butterfly.
In ACM Symposium on Lisp and Functional Programming, pages 132-141, August 1988.

O'D

John T. O'Donnell.
An applicative programming environment.
(draft, unpublished).

O'D85

John T. O'Donnell.
Dialogues: a basis for constructing programming environments.
In 1985 ACM SIGPLAN Symposium on Programming Languages and Programming Environments, in ACM SIGPLAN Notices, Vol. 20, No. 7, July 1985.

O'D87

John T. O'Donnell.
Hardware description with recursion equations.
In Proc IFIP 8th International Symposium on Computer Hardware Description Languages and their Applications [CHDL], 1987.

OH87

John T. O'Donnell and Cordelia Hall.
Debugging in applicative languages.
Technical Report 223, Indiana University Computer Science Department, Bloomington, Indiana, June 1987.
To appear in the International Journal on Lisp and Symbolic Computation.

OK92

et. al. O. Kaser.
Fast parallel implementations of lazy languages: The equals experience.
In ACM Conference on Lisp and Functional Programming, pages 335-344, 1992.

Osb90

Randy B. Osborne.
Speculative computation in multilisp-an overview.
In ACM Conference on Lisp and Functional Programming, pages 198-208, 1990.

PCYL87

Nian-Feng Tzeng Pen-Chung Yew and Duncan H. Lawrie.
Distributed hot-spot addressing in large-scale multiprocessors.
IEEE Transactions on Computers, c-36(4):388-395, April 1987.

PRWM92

Michael S. Lam Paul R. Wilson and Thomas G. Moher.
Caching considerations for generational garbage collection.
In ACM Conference on Lisp and Functional Programming, pages 32-42, June 1992.

Rep91

John H. Reppy.
Cml: A higher-order concurrent language.
In ACM Symposium on Programming Language Design and Implementation, pages 293-305, 1991.

RHH85

Jr. Robert H. Halstead.
Multilisp: A language for concurrent symbolic computation.
ACM Transactions on Programming Languages and Systems, 7(4):501-538, October 1985.

RHH86

Jr. Robert H. Halstead.
An assessment of multilisp: Lessons from experience.
International Journal of Parallel Programming, 15(6):459-500, 1986.

RMKT84

Frank C.H. Lin Robert M. Keller and Jiro Tanaka.
Rediflow multiprocessing.
In IEEE COMPCON, pages 410-417, 1984.

SH91

Peter Steenkiste and John Hennessy.
Tags and type checking in lisp: Hardware and software approaches.
In ACM Conference on Architectural Support for Programming Languages and Systems, pages 50-59, April 1991.

Sin91

Satnam Singh.
Using xview/x11 from miranda.
In Workshops in Computing, Functional Programming, pages 353-363, 1991.

TK88

Pete Tinker and Morry Katz.
Parallel execution of sequential scheme with paratran.
In ACM Symposium on Lisp and Functional Programming, pages 28-39, January 1988.

Tra84

Kenneth R. Traub.
An abstract architecture for parallel graph reduction.
Technical report, MIT, September 1984.
Also available as MIT Technical Report MIT/LCS/TR-317.

Tra91

Kenneth R. Traub.
Implementation of Non-Strict Functional Programming Languages.
MIT Press, 1991.

Veg84

Steven R. Vegdahl.
A survey of proposed architectures for the execution of functional languages.
IEEE Transactions on Computers, c-33(12):1050-1071, December 1984.

WF87

David S. Wise and John Franco.
Costs of quadtree representation of non-dense matrices.
Technical Report 229, Indiana University Computer Science Department, Bloomington, Indiana, October 1987.

Wis81

David S. Wise.
Compact layout of banyan/fft networks.
In H. Kung, B. Sproull, and G. Steele, editors, VLSI Systems and Computations, pages 186-195. Computer Science Press, Rockville, MD, 1981.

Wis84a

David S. Wise.
Parallel decomposition of matrix inversion using quadtrees.
In Proc. 1984 International Conference on Parallel Processing, pages 92-99, 1984.
(available as IEEE Cat. No. 86CH2355-6).

Wis84b

David S. Wise.
Representing matrices as quadtrees for parallel processors.
ACM SIGSAM Bulletin 18, 3, pages 24-25, August 1984.
(extended abstract).

Wis85a

David S. Wise.
Design for a multiprocessing heap with on-board reference counting.
In J. P. Jouannaud, editor, Functional Programming Languages and Computer Architecture, pages 289-304. Springer-Berlin, 1985.

Wis85b

David S. Wise.
Representing matrices as quadtrees for parallel processors.
Information Processing Letters 20, pages 195-199, May 1985.

Wis86a

David S. Wise.
An applicative programmer's approach to matrix algebra, lessons for hardware, and software.
In Workshop on Future Directions in Computer Architecture and Software, Army Research Office, 1986.

Wis86b

David S. Wise.
Parallel decomposition of matrix inversion using quadtrees.
In Proc. 1986 IEEE Intl. Conf. on Parallel Processing. IEEE, 1986.

Wis87

David S. Wise.
Matrix algebra and applicative programming.
In Functional Programming Languages and Computer Architecture, Lecture Notes in Computer Science 274, pages 134-153. Springer-Berlin, 1987.

Zor90

Benjamin Zorn.
Comparing mark-and-sweep and stop-and-copy garbage collection.
In ACM Conference on Lisp and Functional Programming, pages 87-98, 1990.