You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
Joe Reynolds
5af1fef111
|
8 years ago | |
|---|---|---|
| .. | ||
| README.md | 8 years ago | |
| a-poor-mans-concurrency-monad.pdf | 8 years ago | |
| making-a-fast-curry-push-enter-versus-eval-apply-for-higher-order-languages.pdf | 8 years ago | |
| tackling-the-awkward-squad-monadic-input-output-concurrency-exceptions-and-foreign-language-calls-in-haskell.pdf | 8 years ago | |
README.md
Haskell
- A History of Haskell: Being Lazy With Class by Paul Hudak, John Hughes, Simon Peyton Jones
- 📜 Tackling the Awkward Squad: monadic input/output, concurrency, exceptions, and foreign-language calls in Haskell by Simon Peyton Jones
- 📜 Making a Fast Curry: Push/Enter vs. Eval/Apply for Higher-order Languages by Simon Marlow and Simon Peyton Jones. A classic... describes well the execution model GHC uses for Haskell, and catches the brilliant authors in a design pivot from original intuition to new conclusions based on empirical data.
- 📜 A Poor Man's Concurrency Monad by Koen Claessen. Paper describes how without adding any primitives to the language, you could define a concurrency monad transformer in Haskell.
- 📜 Parallel Generational-Copying Garbage Collection with a Block-Structured Heap. In Haskell, data immutability forces us to produce a lot of temporary data but also helps to collect this garbage rapidly. This paper explains how the Glasgow Haskell Compiler accomplishes this task in a simple, yet effective, manner with no programmer intervention.