Gleam Erlang Target Memory Footprint for Low-Traffic Workloads

When targeting the Erlang VM (BEAM), Gleam leverages immutable data structures and exhaustive pattern matching to ensure runtime stability. For low-traffic workloads, the primary goal is to minimize the baseline memory footprint of the compiled bytecode to reduce infrastructure costs.

While Gleam's compilation to Erlang bytecode is efficient, the actual memory overhead of the resulting BEAM files depends on how the compiler handles specific type abstractions and the resulting function density in the generated Erlang modules.

• Does the Gleam compiler implement specific optimizations to reduce the size of generated Erlang modules for small-scale applications?
• What is the expected memory overhead of a minimal Gleam runtime compared to a native Erlang implementation of the same logic?