References

1

P. Achten. Annotations for Load Distribution. In [], pages 247-264, 1991.

2

P. Achten and M. J. Plasmeijer. A Framework for Deterministically Interleaved Interactive Programs in the Functional Programming Language Clean. Technical report, University of Nijmegen, The Netherlands, 1994.

3

G. Aharoni, D. G. Feitelson, and A. Barak. A Run-time Algorithm for Managing the Granularity of Parallel Functional Programs. Journal of Functional Programming, 2(4):387-405, October 1992.

4

G. Akerholt, K. Hammond, S. L. Peyton Jones, and P. W. Trinder. Processing Transactions on GRIP: a Parallel Graph Reducer. In PARLE '93, pages 634-647. Springer-Verlag LNCS 694, 1993.

5

P. Anderson, C. L. Hankin, P. H. J. Kelly, P. E. Osmon, and M. J. Shute. COBWEB-2: Structured Specification of a Wafer Scale Supercomputer. In PARLE '87, pages 51-67. Springer-Verlag LNCS 258, 1987.

6

Arvind, V. Kathail, and K. K. Pingali. A Dataflow Architecture with Tagged Tokens. Technical Report LCS Memo TM-174, MIT, 1980.

7

Arvind and R. S. Nikhil. Can Dataflow Subsume von Neumann Computing? Technical Report CSG Memo 292, MIT, November 1988.

8

L. Augusteijn. Garbage Collection in a Distributed Environment. In PARLE '87, pages 75-93. Springer Verlag LNCS 259, 1987.

9

L. Augustsson. BWM: a Concrete Machine for Graph Reduction. In Glasgow Workshop on Functional Programming, pages 25-35. Springer-Verlag WICS, 1991.

10

L. Augustsson and T. Johnsson. Parallel graph reduction with the -Machine. In FPCA '89, pages 202-213, 1989.

11

J. Backus. Can Programming be Liberated from the von Neumann Style? A Functional Style and its Algebra of Programs. Comm. ACM, 21(8):613-641, August 1978.

12

Jean-Pierre Banâtre and Daniel Le Métayer. Chemical Reaction as a Computational Model. In [], pages 103-117, 1989.

13

H. P. Barendregt, M. C. J. D. van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Term Graph Rewriting. In PARLE '87, pages 141-158. Springer Verlag LNCS 259, 1987.

14

H. P. Barendregt, M. C. J. D. van Eekelen, J. R. W. Glauert, J. R. Kennaway, M. J. Plasmeijer, and M. R. Sleep. Towards an Intermediate Language based on Graph Rewriting. In PARLE '87, pages 159-175. Springer-Verlag LNCS 259, 1987.

15

A. D. Ben-Dyke. The History of Parallel Functional Programming. FTPable from ftp.cs.bham.ac.uk, August 1994.

16

A. J. Bennett and P. H. J. Kelly. Locality and False Sharing in Coherent-Cache Parallel Graph Reduction. In PARLE '93, pages 329-340. Springer-Verlag LNCS 694, 1993.

17

K. J. Berkling. Reduction Languages for Reduction Machines. In 2nd. Annual ACM Symp. on Comp. Arch., pages 133-140. ACM/IEEE 75CH0916-7C, 1975.

18

D. I. Bevan. Distributed Garbage Collection using Reference Counting. In PARLE '87, pages 176-187. Springer Verlag LNCS 259, 1987.

19

G. E. Blelloch. NESL: A Nested Data-Parallel Language (Version 2.6). Technical Report CMU-CS-93-129, School of Computer Science, Carnegie Mellon University, April 1993.

20

G. E. Blelloch, S. Chatterjee, J. C. Hardwick, J. Sipelstein, and M. Zagha. Implementation of a Portable Nested Data-Parallel Language. In Principles and Practices of Parallel Programming, pages 102-111, 1993.

21

T. A. Bratvold. A Skeleton-Based Parallelising Compiler for ML. In [], pages 23-34.

22

W. H. Burge. Recursive Programming Techniques. Addison-Wesley, 1975.

23

G. L. Burn. Lazy Functional Languages: Abstract Interpretation and Compilation. Research Monographs in Parallel and Distributed Computing. Pitman, 1991.

24

Geoffrey L. Burn. Evaluation Transformers - A Model for the Parallel Evaluation of Functional Languages (Extended Abstract). In FPCA '87, pages 446-470. Springer-Verlag LNCS 274, 1987.

25

R. M. Burstall, D. B. MacQueen, and D. T. Sannella. Hope. Technical Report CSR-62-80, Edinburgh University, 1980.

26

F. W. Burton. Nondeterminism with referential transparency in functional programming. In First Intl. Lisp Conference, 1980.

27

F. W. Burton and V. J. Rayward-Smith. Worst Case Scheduling for Parallel Functional Programming. To appear in J. of Functional Programming, 1994.

28

F. W. Burton and M. R. Sleep. Executing functional programs on a virtual tree of processors. In FPCA '81, pages 187-194, 1981.

29

F.W. Burton. Encapsulating Nondeterminacy in an Abstract Data Type with Determinate Semantics. J. of Functional Programming, 1(1):3-20, January 1991.

30

Warren Burton. Annotations to Control Parallelism and Reduction Order in the Distributed Evaluation of Functional Programs. ACM TOPLAS, 6(2), 1984.

31

M. I. Cole. Algorithmic Skeletons: Structured Management of Parallel Computation. Research Monographs in Parallel and Distributed Computing. Pitman, 1989.

32

S. Cox, H. Glaser, and M. J. Reeve. Implementing Functional Languages on the Transputer. In [], pages 287-295, 1989.

33

S. Cox, S.-Y. Huang, P. H. J. Kelly, J. Liu, and F. Taylor. Program Transformation for Static Process Networks. In PARLE '92, pages 497-512. Springer-Verlag LNCS 605, 1992.

34

D. Culler and Arvind. Resource Requirements of Dataflow Programs. In 15th. Annual ACM Symp. on Comp. Arch., 1988.

35

J. Darlington, A. J. Field, P. G. Harrison, P. H. J. Kelly, D. W. N. Sharp, Q. Wu, and R. L. While. Parallel Programming using Skeleton Functions. In PARLE '93, pages 146-160. Springer-Verlag LNCS 694, 1993.

36

J. Darlington and M. J. Reeve. ALICE: A Multiple-Processor Reduction Machine for the Parallel Evaluation of Applicative Languages. In FPCA '81, pages 65-76, 1981.

37

K. Didrich, A. Fett, C. Gerke, W. Grieskamp, and P. Pepper. OPAL: Design and Implementation of an Algebraic Programming Language. In J. Gutknecht, editor, Programming Languages and System Architectures, Zurich, Switzerland, pages 228-244. Springer-Verlag LNCS 782, March 1994.

38

D. L. Eager, J. Zahorjan, and E. D. Lazowska. Speedup versus Efficiency in Parallel Systems. Technical report, Dept. of Computational Science, University of Sasketchewan, 1986.

39

J. Darlington et al. An Introduction to the FLAGSHIP Programming Environment. In CONPAR '88, Manchester. Cambridge University Press, 1988.

40

P. Hartel et al. Pseudoknot: a Float-Intensive Benchmark for Functional Compilers. Submitted to J. of Functional Programming, 1994.

41

J. R. W. Glauert, N. P. Holt, J. R. Kennaway, M. J. Reeve, M. R. Sleep, and I. Watson. Specification of Core DACTL1. Technical Report SYS-C87-09, UEA, 1987.

42

B. Goldberg and P. Hudak. Alfalfa: Distributed Graph Reduction on a Hypercube Multiprocessor. In Workshop on Graph Reduction, Santa Fé, New Mexico, pages 94-113. Springer-Verlag LNCS 279, September 1986.

43

B. F. Goldberg. Multiprocessor Execution of Functional Programs. Intl. Journal of Parallel Programming, 17(5):425-473, 1988.

44

R. G. Goldsmith, D. L. McBurney, and M. R. Sleep. Parallel Execution of Concurrent Clean on ZAPP. In [112], chapter 21.

45

J. R. Gurd, C. C. Kirkham, and I. Watson. The Manchester Prototype Dataflow Computer. Comm. ACM, 28(1):34-52, January 1985.

46

J. R. Gurd, C.C. Kirkham, and J. R. W. Glauert. A Multilayered Data Flow Computer Architecture. Technical report, Manchester University, 1978.

47

K. Hammond. Getting a GRIP. In [].

48

K. Hammond. Efficient Type Inference Using Monads. In Draft Proceedings, Glasgow FP Workshop, Ullapool, Scotland, August 1990.

49

K. Hammond. Parallel SML: a Functional Language and its Implementation in DACTL. Research Monographs in Parallel and Distributed Computing. Pitman, 1991.

50

K. Hammond, J. S. Mattson Jr., and Peyton Jones S. L. Automatic Spark Strategies and Granularity for a Parallel Functional Language Reducer. In CONPAR '94. Springer-Verlag LNCS, September 1994.

51

K. Hammond and S. L. Peyton Jones. Profiling Scheduling Strategies on the GRIP Multiprocessor. In [], 1992.

52

Chris L. Hankin, P. E. Osmon, and M. J. Shute. COBWEB - a combinator reduction architecture. In FPCA '85, pages 99-112, September 1985.

53

P. G. Harrison and M. J. Reeve. The Parallel Graph Reduction Machine, Alice. In Workshop on Graph Reduction, Santa Fé, New Mexico, pages 181-202. Springer-Verlag LNCS 279, September 1986.

54

R. Harrison. Parallel Programming with Pure Functional Languages. In Research Directions in High-Level Parallel Programming Languages. Springer-Verlag LNCS 574, June 1991.

55

C. T. Haynes and D. P. Friedman. Engines Build Process Abstractions. In ACM Conf. on Lisp and Functional Programming, 1984.

56

M. L. Heytens and R. S. Nikhil. List Comprehensions in AGNA, a Parallel Persistent Object System. In FPCA '91. Springer-Verlag LNCS, 1991.

57

J. M. D. Hill. The AIM is Laziness in a Data-Parallel Language. In [], pages 83-99.

58

R. Hofman. Scheduling and Grain Size Control. PhD thesis, Universiteit van Amsterdam, 1994.

59

I. Holyer and D. Carter. Deterministic Concurrency. In [], pages 113-126, 1993.

60

P. Hudak. Distributed Task and Memory Management. In ACM Symp. on Principles of Distributed Computing, pages 277-289, August 1983.

61

P. Hudak. Para-Functional Programming in Haskell. In Boleslaw K. B. K. Szymanski, editor, Parallel Functional Languages and Compilers, Frontier Series, chapter 5, pages 159-196. ACM Press, 1991.

62

P. Hudak and B. Goldberg. Serial Combinators: ``Optimal'' Grains of Parallelism. In FPCA '85, pages 382-399, September 1985.

63

P. Hudak and R. M. Keller. Garbage Collection and Task Deletion in Distributed Applicative Systems. In ACM Symp. on Lisp and Functional Programming, pages 168-178, 1982.

64

P. Hudak, S. L. Peyton Jones, and P. L. Wadler. Report on the Programming Language Haskell: a Non-Strict, Purely Functional Language. Special Issue of SIGPLAN Notices, 16(5), May 1992.

65

P. Hudak and L. Smith. Para-functional Programming: A Paradigm for Programming Multiprocessor Systems. In ACM POPL, pages 243-254, January 1986.

66

R. J. M. Hughes. The Design and Implementation of Programming Languages. PhD thesis, Oxford University, September 1984.

67

R. J. M. Hughes. A Distributed Garbage Collection Algorithm. In FPCA '85, pages 256-272, September 1985.

68

R. J. M. Hughes and J. T. O'Donnell. Expressing and Reasoning about Nondeterministic Functional Programs. In [], pages 308-328, 1989.

69

T. Johnsson. Efficient Compilation of Lazy Evaluation. In ACM SIGPLAN '84 Symp. on Compiler Construction, pages 55-69, Montreal, 1984.

70

M.P. Jones and P. Hudak. Implicit and Explicit Programming in Haskell. Technical Report YALEU/DCS/RR-982, Dept. of Computer Science, Yale University, August 1993.

71

R. M. Keller, F.C.H. Lin, and J. Tanaka. Rediflow multiprocessing. In IEEE Compcon, pages 410-417, February 1984.

72

P. Kelly. Functional Programming for Loosely-coupled Multiprocessors. Research Monographs in Parallel and Distributed Computing. Pitman, 1989.

73

J. R. Kennaway. A Conflict Between Call-by-Need Computation and Parallelism. In 4th. Intl. Workshop on Conditional and Typed Term Rewriting Systems, Jerusalem, July 1994. Springer-Verlag LNCS.

74

J. M. Kewley and K. Glynn. Evaluation Annotations for Hope. In [], pages 329-337.

75

H. Kingdon, D. R. Lester, and G. L. Burn. The HDG-Machine: a Highly Distributed Graph-Reducer for a Transputer Network. The Computer Journal, 34(4), 1991.

76

H. Küchen. Applikative Datenstrukturen in der parallelen abstrakten Maschine PAM. In W. Dosch, editor, Funktionale und Logische Programmierung - Sprachen, Methoden, Implementationen. Report 214, University Augsburg, Germany, December 1989.

77

D. R. Lester. Distributed Garbage Collection of Cyclic Structures. In [], pages 156-169.

78

R. Loogen, H. Küchen, K. Indermark, and W. Damm. Distributed Implementation of Programmed Graph Reduction. In PARLE '89, pages 136-157, 1989.

79

G. A. Magó and D. F. Stanat. The FFP Machine. In High-Level Language Computer Architectures, pages 430-468, 1989.

80

G. Marino and G. Succi. Data Structures for Parallel Execution of Functional Languages. In PARLE '89, pages 346-356, 1989.

81

J. S. Mattson Jr. An Effective Speculative Evaluation Technique for Parallel Supercombinator Graph Reduction. PhD thesis, University of California, San Diego, 1993.

82

J. S. Mattson Jr. and W. G. Griswold. Local Speculative Evaluation for Distributed Graph Reduction. In [], pages 156-169.

83

D. L. McBurney and M. R. Sleep. Transputer-Based Experiments with the ZAPP Architecture. In PARLE '87, pages 242-259. Springer-Verlag LNCS 258, 1987.

84

J. McGraw. SISAL: Streams and Iterations in a Single-Assignment Language: Reference Manual version 1.2. Lawrence Livermore Natl. Lab., 1985. Manual M-146, Revision 1.

85

R. Milikowski and W. G. Vree. The G-line: A Distributed Processor for Graph Reduction. In PARLE '91, pages 119-136. Springer-Verlag LNCS 505, 1991.

86

R. Mohr, D. A. Kranz, and R. H. Halstead. Lazy Task Creation - a Technique for Increasing the Granularity of Parallel Programs. IEEE Transactions on Parallel and Distributed Systems, 2(3), July 1991.

87

R. S. Nikhil. Id (version 90.1) reference manual. Technical Report CSG Memo 284-2, Lab. for Computer Science, MIT, July 1991.

88

R. S. Nikhil, Arvind, and J. Hicks. pH Language Proposal (Preliminary), 1st. September 1993. Electronic communication on comp.lang.functional.

89

R. S. Nikhil, G. M. Papadopoulos, and Arvind. *T: A Multithreaded Massively Parallel Architecture. In 19th. ACM Annual Symp. on Comp. Arch., pages 156-167, 1992.

90

E. G. J. M. H. Nöcker, M. J. Plasmeijer, and S. Smetsers. The Parallel ABC-machine. In [], pages 351-382, 1991.

91

E. G. J. M. H. Nöcker, S. Smetsers, M. C. J. D. van Eekelen, and M. J. Plasmeijer. Concurrent clean. In PARLE '91, pages 202-219. Springer-Verlag LNCS 505.

92

J. T. O'Donnell. Bidirectional Fold and Scan. In [], pages 193-200.

93

G. A. Ostheimer. Parallel Functional Programming for Message-Passing Multiprocessors. PhD thesis, University of St. Andrews, 1993.

94

G. M. Papadopoulos. Implementation of a General Purpose Dataflow Multiprocessor. PhD thesis, Laboratory for Computer Science, MIT, August 1988.

95

A. S. Partridge. Speculative Evaluation in Parallel Implementations of Lazy Functional Languages. PhD thesis, University of Tasmania, 1991.

96

N. Perry. Hope. Technical Report IC/FPR/LANG/2.5.1/7 Issue 5, Imperial College, London, February 1988.

97

S. L. Peyton Jones, C. Clack, and J. Salkid. High-Performance Parallel Graph Reduction. In PARLE '89, pages 193-206, Eindhoven, The Netherlands, June 12-16, 1989. Springer-Verlag LNCS 365.

98

S. L. Peyton Jones, C. Clack, J. Salkild, and M. Hardie. GRIP - a High-Performance Architecture for Parallel Graph Reduction. In FPCA '87, pages 98-112. Springer-Verlag LNCS 274, 1987.

99

M. J. Plasmeijer and M. C. J. D. van Eekelen. Functional Programming and Parallel Graph Rewriting. Addison-Wesley, 1993.

100

F. A. Rabhi. Exploiting Parallelism in Functional Languages: A ``Paradigm-Oriented'' Approach. In T. Lake and P. Dew, editors, Abstract Machine Models for Highly Parallel Computers. Oxford University Press, 1993.

101

H. Richards. An Overview of Burroughs NORMA. Technical report, Austin Research Centre, Burroughs Corp., January 1985.

102

P. Roe. Parallel Programming using Functional Languages. PhD thesis, Glasgow University, April 1991.

103

C. A. Ruggiero and J. Sargeant. Control of Parallelism in the Manchester Dataflow Machine. In FPCA '87, pages 1-15. Springer-Verlag LNCS 274, 1987.

104

C. Runciman and D. Wakeling. Profiling Parallel Functional Computations (Without Parallel Machines). In [], pages 235-248.

105

C. Runciman and D. Wakeling, editors. Functional Languages Applied to Realistic Examplars: the FLARE Project. UCL Press, 1994.

106

J. Sargeant. Load Balancing, Locality and Parallelism Control in Fine-Grain Parallel Machines. Technical Report UMCS-86-11-5, Manchester University, 1987.

107

J. Sargeant and I. Watson. Some Experiments in Controlling the Dynamic Behaviour of Parallel functional programs. In [], pages 103-121, 1991.

108

V. Sarkar. Partitioning and Scheduling Parallel Programs for Execution on Multiprocessors. Research Monographs in Parallel and Distributed Computing. Pitman, 1989.

109

V. Sarkar and J. Hennessy. Partitioning Parallel Programs for Macro-Dataflow. In ACM Symp. on Lisp and Functional Programming, pages 202-211, 1986.

110

W. Schreiner. Parallel Functional Programming - an Annotated Bibliography. Technical Report 93-24, RISC-Linz, Johannes Kepler University, Linz, Austria, May 1993.

111

J. Seward. Abstract Interpretation: a Quantitative Assesment. PhD thesis, Manchester University, 1994.

112

M. R. Sleep, M. J. Plasmeijer, and M. C. J. D. van Eekelen, editors. Term Graph Rewriting: Theory and Practice. Wiley, 1993.

113

G. L. Steel Jr. and W. D. Hillis. Connection-Machine Lisp. In ACM Symp. on Lisp and Functional Programming, pages 279-297, 1986.

114

W. R. Stoye. The Implementation of Functional Languages using Custom Hardware. PhD thesis, University of Cambridge, 1985.

115

P. L. Wadler. The Essence of Functional Programming. In ACM POPL '92, Santa Fé, New Mexico, January 1992.

116

I. Watson. Simulation of a Physical EDS Machine Architecture. Technical report, Department of Computer Science, University of Manchester, UK, September 1989.

117

I. Watson, V. Woods, P. Watson, R. Banach, M. Greenberg, and J. Sargeant. Flagship: a Parallel Architecture for Declarative Programming. In 15th. Annual ACM Symp. on Comp. Arch., page 124, 1988.

118

P. Watson and I. Watson. An Efficient Garbage Collection Scheme for Parallel Computer Architectures. In PARLE '87, pages 432-443. Springer Verlag LNCS 259, 1987.

119

P. Watson and I. Watson. Evaluating Functional Programs on the FLAGSHIP Machine. In FPCA '87, pages 80-97. Springer-Verlag LNCS 274, September 1987.

120

K. G. Waugh. Parallel Imperative Programs from Functional Prototypes. In [], pages 75-88, 1991.

121

W. F. Wong and C. K. Yuen. A Model of Speculative Parallelism. Parallel Processing Letters, 2(3):265-272, 1992.

122

T. Yuba, T. Shimada, K. Hiraki, and H. Kashiwagi. SIGMA-1: A Dataflow Computer for Scientific Computations. Computer Physics Communications, pages 141-148, 1985.