Tag
This article from 1998 argues that ML and OCaml are excellent for writing compilers due to features like garbage collection, tail recursion optimization, and algebraic data types with pattern matching, which simplify handling complex compiler data structures.
This paper introduces Elevator, a novel binary translator that performs deterministic, fully-static translation of entire x86-64 binaries to AArch64 without heuristics or runtime fallbacks. It achieves performance comparable to QEMU while enabling pre-deployment validation and certification of the translated code.
This article presents a minimalist 7-line interpreter for a Turing-equivalent functional language based on lambda calculus, demonstrating the eval/apply design pattern.
The author shares their experience building a custom programming language for a game modding system, discussing design motivations and technical challenges. The post serves as a reflection on the feasibility and complexity of implementing a non-toy language for personal projects.