


default search action
Haskell 2013: Boston, MA, USA
- Chung-chieh Shan:

Proceedings of the 2013 ACM SIGPLAN Symposium on Haskell, Boston, MA, USA, September 23-24, 2013. ACM 2013, ISBN 978-1-4503-2383-3 - Johan Ankner, Josef Svenningsson:

An EDSL approach to high performance Haskell programming. 1-12 - Jean-Philippe Bernardy, Nicolas Pouillard:

Names for free: polymorphic views of names and binders. 13-24 - Richard S. Bird, Jeremy Gibbons, Stefan Mehner, Janis Voigtländer

, Tom Schrijvers
:
Understanding idiomatic traversals backwards and forwards. 25-36 - Mario BlaEevic:

Adding structure to monoids: thus hopefully ending Haskell's string type confusion. 37-46 - Koen Claessen, Michal H. Palka:

Splittable pseudorandom number generators using cryptographic hashing. 47-58 - Oleg Kiselyov, Amr Sabry

, Cameron Swords:
Extensible effects: an alternative to monad transformers. 59-70 - Joe Leslie-Hurd:

Maintaining verified software. 71-80 - Sam Lindley

, Conor McBride:
Hasochism: the pleasure and pain of dependently typed haskell programming. 81-92 - Ben Lippmeier, Manuel M. T. Chakravarty, Gabriele Keller

, Amos Robinson:
Data flow fusion with series expressions in Haskell. 93-104 - Hai Liu, Neal Glew, Leaf Petersen, Todd A. Anderson:

The Intel labs Haskell research compiler. 105-116 - Atze van der Ploeg

:
Monadic functional reactive programming. 117-128 - Andreas Voellmy, Junchang Wang, Paul Hudak, Kazuhiko Yamamoto:

Mio: a high-performance multicore io manager for GHC. 129-140 - Peter Moritz Wortmann, David J. Duke:

Causality of optimized Haskell: what is burning our cycles? 141-152

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














