Pyrolog’s history shows why predictable loops can flatter a JIT
In a Pyrolog retrospective, CF Bolz-Tereick explains how representing both successful and failed continuations as heap objects made Prolog execution easier for a tracing JIT to optimize. Predictable loops could eliminate those allocations. Backtracking with less predictable control flow forced objects to survive outside the optimized region, producing performance cliffs rather than a uniformly faster interpreter.
CF Bolz-Tereick / PyPy · Nov 12, 2026
Why it matters
A benchmark dominated by tidy loops can miss the control-flow patterns that make a language implementation expensive in practice.
More context
The reviewed sections cover the early interpreter and its 2009–2010 redesign. Success and failure continuations keep pending execution state off the host call stack; a trail tracks variable bindings to undo. This is useful reading for interpreter authors evaluating allocation removal and recursion strategies.
Keep in mind
Historical research retrospective, not a new Prolog release or current comparative benchmark. The author says Pyrolog never gained real users. Term unification still used the host stack, so flattening Prolog calls did not remove every recursion limit.
Original read