This tweet explains it all.
I have a huge pile of papers on my computer waiting to be read. Often I read parts of it immediately after I see the paper, but I forget about it until someone points on another article, how awesome that paper is. I then remember to read it more carefully.
One way to fix it is to work with like minded people and have serious (non-hand wavy) discussion around the paper.
The list below will grow. My hard disk has more papers than I can count. I have carefully chosen a list of very readable papers in the list below. Special thanks for the authors for publishing their great ideas.
[Update: 20140406] Please join bangalorehaskell@librelist.com and/or follow me - vu3rdd on twitter for announcements on the meetups.
- Definitional Interpreters for Higher Order programming languages - John C. Reynolds
- Definitional Interpreters revisited - John C. Reynolds
- Theorems for Free - Phil Wadler
- The Next 700 Programming Languages - Peter J. Landin
- A tutorial on the universality and expressiveness of fold - Graham Hutton
- The under-appreciated unfold - Jeremy Gibbons, Geraint Jones
- Three implementation models of Scheme - Kent Dybvig
- Trampolined Style - Steven E. Ganz, Daniel P. Friedman, and Mitchell Wand
- Applications of Continuations - Dan Friedman
- Tackling the awkward squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell - Simon Peyton Jones
- Monads for functional programming - Phil Wadler
- Arrows and Computation - Paterson, Ross
- Applicative programming with effects - Conor McBride, Ross Paterson
- Generalizing Monads to Arrows - John Hughes
- How to replace failure by a List of successes - Phil Wadler
- Engineering a sort function - Doug McIlroy, Jon Bentley.
- On Understanding Data Abstractions, revisited - William Cook
- Hints for Computer System Design - Butler W. Lampson
- An Incremental Approach to Compiler Construction - Abdulaziz Ghuloum
- Compilers: Backend to Frontend and Back to Front Again - Abdulaziz Ghuloum
- A Nanopass Framework for Commercial Compiler Development - Andrew Keep, Kent Dybvig
- The Conception, Evolution, and Application of Functional Programming Languages - Paul Hudak
- QuickCheck:A Lightweight Tool for Random Testing of Haskell Progrograms - John Hughes, Koen Claessen
- Testing monadic code with QuickCheck - John Hughes, Koen Claessen
- Defunctionalization at Work - Olivier Danvy, Lasse R. Nielsen
- Comprehensive Comprehensions Comprehensions with ‘Order by’ and ‘Group by’ - Philip Wadler, Simon Peyton Jones.
- Functional Programming with Bananas, Lenses, Envelopes and Barbed Wire - Erik Meijer, Maarten Fokkinga, Ross Paterson.
- Generics for the masses - Ralf Hinze
- A Java Fork/Join framework - Doug Lea
- Scheduling multithreaded computations by work stealing - RD Blumofe, CF Joerg, BC Kuszmaul, CE Leiserson
- Cilk: An Efficient Multithreaded Runtime System - Robert D. Blumofe, Christopher F. Joerg, Bradley C. Kuszmaul, Charles E. Leiserson, Keith H. Randall, Yuli Zhou
- Executing Task Graphs Using Work-Stealing - Agrawal, K, Charles E. Leiserson
- A Minicourse on Multithreaded Programming - Charles Leiserson
- The Reduceron: Widening the von Neumann Bottleneck for Graph Reduction using an FPGA - Matthew Naylor et al.
- Google’s MapReduce Programming Model — Revisited - Ralf Lammel
- The Yampa Arcade - Antony Courtney, Henrik Nilsson, John Peterson
- Functional Reactive Programming from First Principles - Y. Wan, Paul Hudak
- Arrows, Robots and Functional Reactive Programming - Paul Hudak
- Cheap Deforestation for Non-strict Functional Languages - Andrew John Gill
- Deforestation: transforming programs to eliminate trees - Phil Wadler
- Playing by the rules: Rewriting as a practical optimization technique in GHC - Simon Peyton Jones et. al.
- Chalmers course notes - Parallel Functional Programming course notes and links to papers.
- Steven Diehl - A Haskell reading list
- WUSTL Haskell/Scheme group