Transformations on Applicative Concurrent Computations - FP Complete
When deciding which language to use to solve challenges that require heavy concurrent algorithms, it’s hard to not consider Haskell. Its immutable and persistent data structures reduce the introduction of accidental complexity, and the GHC runtime facilitates the creation of thousands of (green) threads without having to worry as much about the memory and performance costs. The epitome of Haskell’
When Rust is safer than Haskell - FP Complete
We’re big fans of safety-focused languages at FP Complete. As our previous blog post comparing Rust and Haskell made clear, we think both of these are great languages. A recurring theme we have for both internal and client projects is: which language should we use? The general guidelines in that blog post apply: If there’s a specific requirement (e.g., hard realtime) that prefers avoiding garbage
Pinpointing deadlocks in Haskell - FP Complete
Concurrent programming is hard! I still remember the moment of my introduction to multi-threaded programming at the University of New Mexico, our professor grabbed his head and said: “Here be demons!”. There are all sorts of issues that arise in a concurrent setup, such as race conditions, starvation, deadlocks, data corruption, you name it. All of these are also applicable to Haskell, and in this
HaskellのSTMとトランザクション分離レベル
Haskellのatomicブロックがserializableな分離レベルを提供してる所まではわかったけれど、その効率的な実装には謎が残るばかり。
Haskell における並行処理と並列処理と最適化 - Qiita
TL;DR 並列処理はかなり有効 並行処理もそこそこ有効（forkIO） 並列処理に迫る並行処理もあった（async） はじめに Haskell で処理をマルチコアに分散したい場合どのようにすればよいかをまとめておきます。 負荷のかかる処理としてフィボナッチ数の導出を以下のように行うことにします。
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
GitHub - awkward-squad/ki: A structured concurrency library
GitHub - UnkindPartition/immortal: Spawn threads that never die (unless told to do so)
GitHub - prikhi/immortal-queue: Build a Queue-Processing Worker Pool using Immortal
GitHub - athanclark/chan: Some extra kit for Chans
GitHub - mitchellwrosen/timer-wheel: A hashed timer wheel
GitHub - nh2/conduit-concurrent-map: Concurrent, order-preserving mapping Conduit for Haskell
GitHub - mcschroeder/ctrie: Non-blocking concurrent hashmap for Haskell
GitHub - nikita-volkov/slave-thread: A principal solution to ghost threads and silent exceptions
GitHub - roman/Haskell-capataz: OTP-like supervision trees in Haskell
GitHub - basvandijk/threads: Fork threads and wait for their result
GitHub - rrnewton/thread-local-storage: A TLS library for GHC Haskell.
GitHub - ChrisKuklewicz/SafeSemaphore: SafeSemaphore is a Haskell library replacing non-exception safe libraries like QSem, QSemN, SampleVar
GitHub - ekmett/rcu: experimenting with STM-backed read-copy-update in Haskell