ACM Home Page
Please provide us with feedback. Feedback
A short cut to deforestation
Full text PdfPdf (925 KB)
Source Functional Programming Languages and Computer Architecture archive
Proceedings of the conference on Functional programming languages and computer architecture table of contents
Copenhagen, Denmark
Pages: 223 - 232  
Year of Publication: 1993
ISBN:0-89791-595-X
Authors
Sponsors
SIGARCH: ACM Special Interest Group on Computer Architecture
IFIP WG 2.8 : IFIP WG 2.8
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 10,   Downloads (12 Months): 76,   Citation Count: 64
Additional Information:

references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/165180.165214
What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
S Anderson & P Hudak {March 1989}, "Efficient compilation of Haskell array comprehensions," Dept Comp Sci, Yale University.
 
2
L Augustsson {1987}, "Compiling lazy functional languages, part II," PhD thesis, Dept Comp Sci, Chalmers University, Sweden.
 
3
 
4
WH Burge {Oct 1977}, "Examples of progra~n optimization," RC 6351, IBM Thomas J Watson Research Centre.
5
 
6
L Cardelli & G Longo{Oct 1991}, "A semantic basis for Quest," Journal &Functional Programming 1,417- 458.
 
7
WN Chin{March 1990}, "Automatic methods for program transformation," PhD thesis, Imperial College, London.
 
8
K Davis {Sept 1987}, "Deforestation: Transformation of functional programs to eliminate intermed-ate trees," MSc Thesis, Programming Research Group, Oxford University.
 
9
J Fairbairn {May 1985}, "Design and implementation of a simple typed language based on l~he lambda calculus," TR 75, Computer Lab, Cambridge.
 
10
AB Ferguson & PL Wadler {1988}, "When will deforesation stop?,' in Functional Programming, Glasgow 1988.
 
11
MM Fokkinga, E Meijer, J Jeuring, L Meertens {1992}, "FRATS: a parallel reduction strategy for shared memory," The $qu/ggo//st 2, 20-26, KG Langendoen & WG Vree.
12
 
13
RJM Hughes {July 1983}, "The design a~Ld implementation of programming languages," Phi) thesis, Programming Research Group, Oxford.
 
14
RJM Hughes {Oct 1984}, "A novel representation of lists and its application to the function 'Reverse'," PMG-38, Programming Methodology Group, Chalmers Inst, Sweden.
 
15
 
16
R Milner {Dec 1978}, "A theory of type polymorphism in programming," JCSS 13.
 
17
 
18
SL Peyton Jones{1993}, "The Glasgow Haskell compiler: a technical overview," in Joint Framework for In{ormat/on Technology Techn/ca/ Conference, Keele.
19
 
20
JC Reynolds {1983}, "Types, abstraction and parametric polymorphism," in Information Processing 83, REA Mason, ed., North-Holland, 513-523.
 
21
MR Sleep & S Holmstrom {May 1982}, "A short note concerning lazy reduction rules of APPEND," University of East Anglia.
 
22
VF Tur~ {1988}, "The algorithm of generalization in the supercompfler,' in Partial Evaluation and Mixed Computation, Bjerner, Ershov & Jones, eds., North- Holland.
 
23
PL Wadler{1987}, "List Comprehensions," in The Implementation of Functional Programming Languages, SL Peyton Jones, ed., Prentice Hall, 127-138.
24
 
25
 
26
PL Wadler {Dec 1987}, "The concatenate vanishes," Dept of Computer Science, Glasgow University.
27
28

CITED BY  64

Collaborative Colleagues:
Andrew Gill: colleagues
John Launchbury: colleagues
Simon L. Peyton Jones: colleagues