Create recursion-schemes using comonads
In today's post, I explain how comonads can be used to create a tailor-made recursion scheme to perform computations based on multiple simultaneous folds over a single recursive data type. The technique is based on the theoretical heavy paper named "Recursion Schemes from Comonads", but I will try to explain it as much as possible in an approachable way from a pragmatic point of view. I will assum
Making LLVM GEP safer in Haskell
In today's article, I will showcase how Haskell's typesystem can be used to simplify code generation and reduce the chance of bugs involving the LLVM getelementptr instruction. Intro to the GEP instruction LLVM as a compiler framework offers many different low-level instructions, one of which being the getelementptr instruction (commonly abbreviated as just "gep"). With gep, you can compute derive
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
処理を実行中です
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
How to lower an IR?
Static analysis using Haskell and Datalog
Combining folds using semigroups
