Compiling higher order functions with GADTs
Implementing first class functions in a bytecode interpreter is trivial. But how do compilers that generate machine code (or lower to C, or SSA) implement higher order functions? Back in 2021, I found an answer when contributing closures to the Pallene compiler. Today I was researching something loosely related, and found yet another neat trick called defunctionalization in this paper. Defunctiona
8 months of OCaml after 8 years of Haskell in production
I've been using Haskell in production for 8 years. I've been using OCaml in production for 8 months. It's time to compare those two languages. Syntax Haskell probably has the most elegant syntax across all languages I've seen (maybe Idris is better because dependently typed code can become ugly in Haskell really quickly). There's utter joy in expressing your ideas by typing as few characters as po
1
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
Compiling higher order functions with GADTs | Lobsters
8 months of OCaml after 8 years of Haskell in production | Lobsters