Future Scientific Programming on Parallel Machines

[1]  Arvind,et al.  Executing a Program on the MIT Tagged-Token Dataflow Architecture , 1987, IEEE Trans. Computers.

[2]  Alan H. Karp,et al.  Programming for Parallelism , 1987, Computer.

[3]  David A. Padua,et al.  Advanced compiler optimizations for supercomputers , 1986, CACM.

[4]  Keshav Pingali,et al.  I-structures: data structures for parallel computing , 1986, Graph Reduction.

[5]  K. R. Traub,et al.  A COMPILER FOR THE MIT TAGGED-TOKEN DATAFLOW ARCHITECTURE , 1986 .

[6]  James W. Moore,et al.  A Benchmark Comparison of Three Supercomputers: Fujitsu VP-200, Hitachi S810/120, and Cray X-MP/2 , 1985, Computer.

[7]  John Glauert,et al.  SISAL: streams and iteration in a single assignment language. Language reference manual, Version 1. 2. Revision 1 , 1985 .

[8]  Gerald J. Sussman,et al.  Structure and interpretation of computer programs , 1985, Proceedings of the IEEE.

[9]  Thomas Johnsson,et al.  Lambda Lifting: Treansforming Programs to Recursive Equations , 1985, FPCA.

[10]  Guy L. Steele,et al.  Common Lisp the Language , 1984 .

[11]  James R. McGraw,et al.  The VAL Language: Description and Analysis , 1982, TOPL.

[12]  D. A. Turner.  The semantic elegance of applicative languages , 1981, FPCA '81.

[13]  John W. Backus,et al.  Can programming be liberated from the von Neumann style?: a functional style and its algebra of programs , 1978, CACM.

[14]  John McCarthy,et al.  Recursive functions of symbolic expressions and their computation by machine, Part I , 1960, Commun. ACM.