A. Bloss, P. Hudak, and J. Young. An optimising compiler for a modern functional language. The Computer Journal, 32(2):152--161, April 1989. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
The HDG-Machine: A Highly Distributed Graph-Reducer for a.. - Kingdon (1991) (22 citations) (Correct)
....that some form of object oriented approach is required. The tag is then a pointer to a table of addresses. Each entry in the table corresponds to an operation to be performed. For example the first entry might evaluate the object, the second might print it, and so on. Augustsson and Johnsson [1989] contend that one should test the least significant bit of the tag, which indicates whether a node is already evaluated. They claim that some 70 per cent of the time that this bit is tested, the nodes are evaluated. An alternative view is that of Peyton Jones and Salkild [1989] They claim that it ....
....and Johnsson [1989] contend that one should test the least significant bit of the tag, which indicates whether a node is already evaluated. They claim that some 70 per cent of the time that this bit is tested, the nodes are evaluated. An alternative view is that of Peyton Jones and Salkild [1989]. They claim that it is easier to always jump through the tag, in a similar way to the traditional G machine. In theory Augustsson and Johnsson are right. Their scheme results in at most one pipe line break and, with the right sort of hardware, it is possible that an intelligent prefetch could ....
A. Bloss, P. Hudak, and J. Young. An optimising compiler for a modern functional language. The Computer Journal, 32(2):152--161, April 1989.
Linear Types Can Change the World! - Wadler (1990) (5 citations) (Correct)
....be straightforward to transform any single threaded semantics (well, any one that doesn t discard its store) into an equivalent program with a linear store type. A great deal of work has gone into compile time analysis to determine when destructive updating is safe, notably by Bloss and Hudak [Blo89, BHY89, Hud86]; older analysis techniques for determining when list cells can be reused go back to Darlington and Burstall [DB76] Analysis techniques have the advantage that destructive updating can be inferred whether the user indicates it explictly or not. With linear types, the user must decide which types ....
A. Bloss, P. Hudak, and J. Young, An optimising compiler for a modern functional language. Computer Journal, 32(2):152--161, April 1989.
A New Means of Ensuring Termination of Deforestation - Sørensen (1993) (Correct)
No context found.
Adrienne Bloss, P. Hudak, J. Young. An Optimising Compiler for a Modern Functional Language. In The Computer Journal. vol 31. no 6, 1988.
The nofib Benchmark Suite of Haskell Programs - Partain (1993) (24 citations) (Correct)
No context found.
Adrienne Bloss, P. Hudak, and J. Young. An optimising compiler for a modern functional language. Computer Journal, 32(2):152--161, April 1989. 2 Citation withheld to protect the guilty!
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC