Predictable Performance of OCaml's Module System

OCaml’s module system can be a powerful tool for building generic code and structuring systems. Functors are functions from modules to modules and they serve an important role for the power of module system. However, I want to know if functors (and the module system) can be optimized away by the OCaml compiler.

<span title='2020-12-19 00:00:00 +0800 CST'>December 19, 2020</span>&nbsp;·&nbsp;poga

Going through the OCaml compiler pipeline (manually)

Modern compilers usually composed by multiple stages: parsers, optimizers, linkers, and assemblers. Let’s go through it one by one to have a better understanding of the OCaml compiler.

<span title='2020-11-30 00:00:00 +0800 CST'>November 30, 2020</span>&nbsp;·&nbsp;poga

A Taste of OCaml's Predictable Performance

eqaf, a constant-time compare function implementation in OCaml, is a great case to demonstrate the predictable performance of OCaml’s compiler. Why?

<span title='2020-11-21 00:00:00 +0800 CST'>November 21, 2020</span>&nbsp;·&nbsp;poga

Cheney on the M.T.A

如果問軟體工程師他覺得簡潔又經典的文章,我想很多人會回答你這篇:Cheney on the M.T.A. ...

<span title='2019-07-12 00:00:00 +0800 CST'>July 12, 2019</span>&nbsp;·&nbsp;poga

LuaJIT 實做探索 — NaN Tagging

一切都是為了效能 故事要從 boxed value 跟 unboxed value 說起。 ...

<span title='2018-04-18 00:00:00 +0800 CST'>April 18, 2018</span>&nbsp;·&nbsp;poga