newsfilter.io
Webinar, Tutorial, Lecture

Pitfalls with Tail Calls and Locals in OCaml | OCaml Unboxed

Jane StreetGoldfirere
Watch on YouTube →
  • The video series will continue exploring "local mode" for the OCaml compiler branch, with future episodes planned to demonstrate placing global items into lists, a behavior not currently default.
  • Planned code refinements include modifying the count firsts function to return 0 for empty inputs and adding type annotations to accept any local list returning an integer.
  • While constant lists currently avoid heap allocation, the general case may require heap memory, which the local stack feature aims to prevent.
  • The program is expected to compile and run successfully if variable X is changed to the constant 3, eliminating the need to close over a local variable.
  • Adding a non-tail annotation is predicted to introduce a small, non-significant stack frame overhead, whereas recursive usage of this annotation on long lists may result in O(n) stack allocation.
  • The anticipated O(n) stack allocation from recursive non-tail annotations is characterized as undesirable.
  • Prior to the feature's upstreaming, improved heuristics or a better story are expected to be developed to minimize the necessity of frequent non-tail annotations.
  • The current reliance on non-tail annotations is described as an unfortunate aspect that requires improvement before the feature is considered production-ready.