default search action
Haskell 2010: Baltimore, MD, USA
- Jeremy Gibbons:
Proceedings of the 3rd ACM SIGPLAN Symposium on Haskell, Haskell 2010, Baltimore, MD, USA, 30 September 2010. ACM 2010, ISBN 978-1-4503-0252-4
Libraries
- Tillmann Rendel, Klaus Ostermann:
Invertible syntax descriptions: unifying parsing and pretty printing. 1-12 - Milan Straka:
The performance of the Haskell containers package. 13-24
Language design and implementation
- Maciej Piróg, Dariusz Biernacki:
A systematic derivation of the STG machine verified in Coq. 25-36 - José Pedro Magalhães, Atze Dijkstra, Johan Jeuring, Andres Löh:
A generic deriving mechanism for Haskell. 37-48 - John H. G. van Groningen, Thomas van Noort, Peter Achten, Pieter W. M. Koopman, Rinus Plasmeijer:
Exchanging sources between clean and Haskell: a double-edged front end for the clean compiler. 49-60 - J. Garrett Morris:
Experience report: using hackage to inform language design. 61-66
Parallelism and concurrency
- Geoffrey Mainland, Greg Morrisett:
Nikola: embedding compiled GPU functions in Haskell. 67-78 - John Launchbury, Trevor Elliott:
Concurrent orchestration in Haskell. 79-90 - Simon Marlow, Patrick Maier, Hans-Wolfgang Loidl, Mustafa Aswad, Philip W. Trinder:
Seq no more: better strategies for parallel Haskell. 91-102 - Bryan O'Sullivan, Johan Tibell:
Scalable i/o event handling for GHC. 103-108
Compilation and static analysis
- David A. Terei, Manuel M. T. Chakravarty:
An llVM backend for GHC. 109-120 - Norman Ramsey, João Dias, Simon L. Peyton Jones:
Hoopl: a modular, reusable library for dataflow analysis and transformation. 121-134 - Maximilian C. Bolingbroke, Simon L. Peyton Jones:
Supercompilation by evaluation. 135-146
Functional pearl
- Brent A. Yorgey:
Species and functors and types, oh my! 147-158
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.