An effective speculative evaluation technique for parallel supercomb

[1]  Simon L. Peyton Jones,et al.  The spineless tagless G-machine , 1989, FPCA.

[2]  Simon L. Peyton Jones,et al.  The Implementation of Functional Programming Languages , 1987 .

[3]  Simon L. Peyton Jones,et al.  Parallel Implementations of Functional Programming Languages , 1989, Comput. J..

[4]  Daniel P. Friedman,et al.  CONS Should Not Evaluate its Arguments , 1976, ICALP.

[5]  F. Warren Burton,et al.  Speculative computation, parallelism, and functional programming , 1985, IEEE Transactions on Computers.

[6]  Simon Peyton Jones,et al.  Some Early Experiments on the GRIP Parallel Reducer , 1990 .

[7]  Simon L. Peyton Jones,et al.  GRIP - A high-performance architecture for parallel graph reduction , 1987, FPCA.

[8]  Jon Fairbairn,et al.  TIM: A simple, lazy abstract machine to execute supercombinatorics , 1987, FPCA.

[9]  Maurice Herlihy,et al.  Lock-Free Garbage Collection for Multiprocessors , 1992, IEEE Trans. Parallel Distributed Syst..

[10]  A. H. Dekker,et al.  Speculative parallelism in a distributed graph reduction machine , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

[11]  John Hughes,et al.  Why Functional Programming Matters , 1989, Comput. J..

[12]  Simon L. Peyton Jones,et al.  The spineless G-machine , 1988, LISP and Functional Programming.

[13]  D. A. Turner,et al.  A new implementation technique for applicative languages , 1979, Softw. Pract. Exp..

[14]  Thomas Johnsson,et al.  Efficient compilation of lazy evaluation , 1984, SIGPLAN '84.

[15]  Paul Hudak,et al.  Serial Combinators: "Optimal" Grains of Parallelism , 1985, FPCA.

[16]  Richard P. Gabriel,et al.  Qlisp: An Interim Report , 1989, Workshop on Parallel Lisp.

[17]  Simon L. Peyton Jones,et al.  Report on the programming language Haskell: a non-strict, purely functional language version 1.2 , 1992, SIGP.

[18]  P. J. Landin.  The Mechanical Evaluation of Expressions , 1964, Comput. J..

[19]  Paul Hudak,et al.  Garbage collection and task deletion in distributed applicative processing systems , 1982, LFP '82.

[20]  Simon L. Peyton Jones,et al.  A modular fully‐lazy lambda lifter in Haskell , 1991, Softw. Pract. Exp..

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

[22]  R. J. M. Hughes,et al.  Super-combinators a new implementation method for applicative languages , 1982, LFP '82.

[23]  Alan Mycroft,et al.  Abstract interpretation and optimising transformations for applicative programs , 1982 .

[24]  Paul Hudak.  Distributed task and memory management , 1983, PODC '83.

[25]  Rex L. Page,et al.  Deleting Irrelevant Tasks in an Expression-Oriented Multiprocessor System , 1981, TOPL.

[26]  Randy B. Osborne,et al.  Speculative computation in multilisp , 1989, LISP and Functional Programming.

[27]  Simon L. Peyton Jones,et al.  High-Performance parallel graph reduction , 1989, PARLE.

[28]  Keshav Pingali,et al.  Efficient demand-driven evaluation. Part 1 , 1985, TOPL.

[29]  Paul Roe,et al.  Parallel programming using functional languages , 1991 .

[30]  John Sargeant,et al.  Control of parallelism in the Manchester Dataflow Machine , 1987, FPCA.

[31]  Andrew Simon Partridge,et al.  Speculative evaluation in parallel implementations of lazy functional languages , 1991 .