Management of dynamic memory allocations is causing memory usage to grow as the program runs. Since the number of individuals is fixed, then dynamically allocating memory as needed may not make sense. What is needed is a Push interpreter which uses pre-allocated memory instead of dynamically allocated memory. However, Push is based on the premises of infinite stack dept. Plush is a flat model but gets converted to Push before execution. What is needed is a Plush processor which could execute the Plush code directly using fixed-memory stacks.
Management of dynamic memory allocations is causing memory usage to grow as the program runs. Since the number of individuals is fixed, then dynamically allocating memory as needed may not make sense. What is needed is a Push interpreter which uses pre-allocated memory instead of dynamically allocated memory. However, Push is based on the premises of infinite stack dept. Plush is a flat model but gets converted to Push before execution. What is needed is a Plush processor which could execute the Plush code directly using fixed-memory stacks.