Neander's Budget System Caps Computation, Memory, and Time With Hard Limits
Neander, a sub-Turing programming language, includes a built-in budget system that enforces six hard upper bounds on any running program. Three of these are runtime consumption limits covering computation, memory, and time, while the other three are static caps checked before execution begins. Computation is measured in 'Thalers' — a unit named after an old silver coin — with a detailed cost table assigning one Thaler to operations like arithmetic, comparisons, and field access. Exceeding a static cap results in a 'Flaw' rejection before execution, whereas overspending a runtime budget triggers an 'Abort' that halts execution immediately. The budget system is defined as a core part of the Neander language specification, not an optional feature of any single runtime implementation.
This is an AI-generated summary. ShortSingh links to the original source for the complete article.
Discussion (0)
Log in to join the discussion and vote.
Log in