Changes between Version 8 and Version 9 of ReadingList


Ignore:
Timestamp:
Dec 19, 2012 11:38:18 PM (3 years ago)
Author:
dterei
Comment:

--

Legend:

Unmodified
Added
Removed
Modified
  • ReadingList

    v8 v9  
    4141 * [http://research.microsoft.com/en-us/um/people/simonpj/papers/rules.htm Playing by the rules: rewriting as a practical optimisation technique in GHC], Simon Peyton Jones, Andrew Tolmach and Tony Hoare, Haskell Workshop 2001.  Describes how RULES work, which are heavily used in GHC. 
    4242 
     43* [https://research.microsoft.com/en-us/um/people/simonpj/papers/spec-constr/spec-constr.pdf Call-pattern Specialisation for Haskell Programs], Simon Peyton Jones, ICFP 2007. Describe the specialisation optimiser. 
     44 
     45* [http://research.microsoft.com/pubs/67060/float.ps.gz Let-floating: moving bindings to give faster programs], Simon Peyton Jones, Will Partain, and Andre Santos, ICFP 1996. Describe the let floating and full laziness optimisation passes. 
     46 
    4347== Data Parallel Haskell == 
    4448 
     
    4953 * [http://www.cse.unsw.edu.au/~chak/papers/vect-avoid.pdf Vectorisation Avoidance], Gabriele Keller, Manuel M. T. Chakravarty, Roman Leshchinskiy, Ben Lippmeier, and Simon Peyton Jones, Proceedings of ACM SIGPLAN Haskell Symposium 2012, ACM Press, 2012.  
    5054 
    51  * [http://www.cse.unsw.edu.au/~chak/papers/replicate.pdf Work Efficient Higher-Order Vectorisation], Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, and Simon Peyton Jones, The 17th ACM SIGPLAN International Conference on Functional Programming, ACM Press, 2012  
     55 * [http://www.cse.unsw.edu.au/~chak/papers/replicate.pdf Work Efficient Higher-Order Vectorisation], Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller, Roman Leshchinskiy, and Simon Peyton Jones, The 17th ACM SIGPLAN International Conference on Functional Programming, ACM Press, 2012 
     56 
     57== Intermediate Representation of GHC (Core & Related) == 
     58 
     59* [http://www.haskell.org/ghc/docs/6.10.4/html/ext-core/core.pdf An External Representation for the GHC Core Language] Gives an overview of the semantics and syntax of Core, GHC's internal intermediate representation for Haskell that most of the optimisation work is done on. A good language to understand when starting with GHC. 
     60 
     61* [http://www.haskell.org/ghc/docs/papers/unboxed-values.ps.gz Unboxed Values as First-Class Citizens], Simon L Peyton Jones and John Launchbury, Conference on Functional Programming Languages and Computer Architecture, September 1991. Describe the design of GHC language and internals for handling machine values and boxing / unboxing them as lazy values. 
    5262 
    5363== Code generation and virtual machine == 
     
    6171Please add: Hoopl, C--. 
    6272 
     73== IO and Related == 
     74 
     75* [https://research.microsoft.com/en-us/um/people/simonpj/papers/marktoberdorf/mark.pdf Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell], Simon Peyton Jones. Deals with the incarnation of IO in Haskell and GHC. The history getting to monads, handling exceptions and handling concurrency. 
     76 
     77* [http://www.haskell.org/ghc/docs/papers/imperative.ps.gz Imperative Functional Programming], Simon Peyton Jones, Philip Wadler. POPL,  Jan 1993, pp71-84. Presents Monads as a way of implementing IO in Haskell. 
     78 
     79* [http://www.haskell.org/ghc/docs/papers/concurrent-haskell.ps.gz Concurrent Haskell], Simon Peyton Jones, Andrew Gordon, Sigbjorn Finne. Deals with the various concurrency constructs in GHC and the Haskell language. E.g., MVars. 
     80 
    6381== The run-time system and garbage collector == 
    6482