Daisy/DSI Bibliography

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.

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.

Hal87

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

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.

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).

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.

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.

Last modified: Fri Dec 19 15:01:44 HST 2003