Andrew Gill
John Launchbury
Simon L. Peyton Jones
- S Anderson & P Hudak {March 1989}, "Efficient compilation of Haskell array comprehensions," Dept Comp Sci, Yale University.Google Scholar
- L Augustsson {1987}, "Compiling lazy functional languages, part II," PhD thesis, Dept Comp Sci, Chalmers University, Sweden.Google Scholar
- R Bird & PL Wadler {1988}, Introduction to Fimctional Protramming, Prentice Hall. Google ScholarDigital Library
- WH Burge {Oct 1977}, "Examples of progra~n optimization," RC 6351, IBM Thomas J Watson Research Centre.Google Scholar
- RM Burstall & John Darlington {Jan 1977}, "A transformation system for developing recursive programs," JACM 24, 44-67. Google ScholarDigital Library
- L Cardelli & G Longo{Oct 1991}, "A semantic basis for Quest," Journal &Functional Programming 1,417- 458.Google ScholarCross Ref
- WN Chin{March 1990}, "Automatic methods for program transformation," PhD thesis, Imperial College, London.Google Scholar
- K Davis {Sept 1987}, "Deforestation: Transformation of functional programs to eliminate intermed-ate trees," MSc Thesis, Programming Research Group, Oxford University.Google Scholar
- J Fairbairn {May 1985}, "Design and implementation of a simple typed language based on l~he lambda calculus," TR 75, Computer Lab, Cambridge.Google Scholar
- AB Ferguson & PL Wadler {1988}, "When will deforesation stop?,' in Functional Programming, Glasgow 1988.Google Scholar
- 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.Google Scholar
- P Hudak, SL Peyton Jones, PL Wadler, Arvind, B Boutel, J Fairbairn, J Fasel, M Guzmaxt, K Hammond, J Hughes, T Johnsson, R Kieburtz, RS Nikhil, W Partain & J Peterson{May 1992:}, "Report on the functional programming language Haskell, Version 1.2," SIGPLAN Notices 27. Google ScholarDigital Library
- RJM Hughes {July 1983}, "The design a~Ld implementation of programming languages," Phi) thesis, Programming Research Group, Oxford.Google Scholar
- RJM Hughes {Oct 1984}, "A novel representation of lists and its application to the function 'Reverse'," PMG-38, Programming Methodology Group, Chalmers Inst, Sweden.Google Scholar
- S Marlow & PL Wadler {1993}, "Deforestation for higherorder functions," in Fimctional Programming, Glasgow 1992, J Launchbury, ed., Workshops in Computing, Springer Verlag. Google ScholarDigital Library
- R Milner {Dec 1978}, "A theory of type polymorphism in programming," JCSS 13.Google Scholar
- E Moggi {June 1989}, "Computational lambda calculus and monads," in Logic in Computer Sc/ence, Ca/fforma, IEEE. Google ScholarDigital Library
- SL Peyton Jones{1993}, "The Glasgow Haskell compiler: a technical overview," in Joint Framework for In{ormat/on Technology Techn/ca/ Conference, Keele.Google Scholar
- SL Peyton Jones & PL Wadler {Jan 1993}, "Imperative functional programming," in 20th ACM Symposium on Principles of Programming Languages, Charleston, ACM. Google ScholarDigital Library
- JC Reynolds {1983}, "Types, abstraction and parametric polymorphism," in Information Processing 83, REA Mason, ed., North-Holland, 513-523.Google Scholar
- MR Sleep & S Holmstrom {May 1982}, "A short note concerning lazy reduction rules of APPEND," University of East Anglia.Google Scholar
- VF Tur~ {1988}, "The algorithm of generalization in the supercompfler,' in Partial Evaluation and Mixed Computation, Bjerner, Ershov & Jones, eds., North- Holland.Google Scholar
- PL Wadler{1987}, "List Comprehensions," in The Implementation of Functional Programming Languages, SL Peyton Jones, ed., Prentice Hall, 127-138.Google Scholar
- PL Wadler {1989}, "Theorems for free!," in Fourth International Conference on Functional Programming and Computer Architecture, London, MacQueen, ed., Addison Wesley. Google ScholarDigital Library
- PL Wadler {1990}, "Deforestation: transforming programs to eliminate trees," Theoretical Computer Science 73, 231-248. Google ScholarDigital Library
- PL Wadler {Dec 1987}, "The concatenate vanishes," Dept of Computer Science, Glasgow University.Google Scholar
- PL Wadler {June 1990}, "Comprehending monads," in Proc A CM Conference on Lisp and Functional Programmeg, Nice, ACM. Google ScholarDigital Library
- R Waters{Jan 1991}, "Automatic Transformation of Series Expressions into Loops," ACM TOPLAS 13, 52-98. Google ScholarDigital Library
Index Terms
- A short cut to deforestation
Recommendations
Lifting facets of the cut polytope
The cut polytope P"c(G) of a graph G is the convex hull of the incidence vectors of the edge sets of all cuts of G. We give a sufficient condition for an inequality defining a facet of P"c(G) to define a facet of the cut polytope of a graph containing G ...
On the cut polytope
The cut polytopePC(G) of a graphG=(V, E) is the convex hull of the incidence vectors of all edge sets of cuts ofG. We show some classes of facet-defining inequalities ofPC(G). We describe three methods with which new facet-defining inequalities ofPC(G) ...
Typer inference builds a short cut to deforestation
Deforestation optimises a functional program by transforming it into another one that does not create certain intermediate data structures. Short cut deforestation is a deforestation method which is based on a single, local transformation rule. In ...
Comments