ERLANG / CORE CONCEPTS
Single assignment and recursive state
Learn how single assignment and recursive state works in Erlang, why the underlying model matters, and how to apply it in a small program without hiding important trade-offs.
What you will learn
- Explain single assignment in Erlang using the correct mental model
- Trace a focused Erlang example and predict its result before execution
- Recognize a boundary case involving recursive state and handle it deliberately
Understanding Single assignment and recursive state
Single assignment and recursive state belongs to the practical core of Erlang. Start by identifying the values or state involved and the rule that connects the input to the result.
Trace the example one operation at a time. Keep single assignment visible in the code rather than hiding it behind an abstraction before the behavior is understood.
Test a normal case and a boundary case. The difference between the prediction and the observed result is the most useful signal for deciding what to review next.
Single assignment and recursive state is a defining part of practical Erlang work. Start by identifying the data or state involved, then trace the operation that changes or interprets it. Pay attention to the rules Erlang applies at this boundary, because those rules explain both the useful behavior and the common failure modes. This lesson keeps the example deliberately small, then connects it to tuples, lists, maps, atoms, and binaries so the ideas form a coherent progression rather than a list of isolated syntax facts.
Worked examples
Single assignment and recursive state example
A focused Erlang example for single assignment.
-module(main).
-export([start/0]).
start() -> io:format("Hello from Erlang~n").
// Lesson 3: single assignment. Change one value and predict the result before running it.Example explained
Line 1Identify where single assignment appears in the Erlang example and name the data it operates on.
Line 2Trace the relevant Erlang rule one operation at a time, recording any state, type, or control-flow change.
Line 3Change one input or boundary condition, predict the result, and compare that prediction with the documented outcome.
Important notes
Keep the first single assignment example small enough to trace completely.
Use the normal Erlang toolchain or browser workspace to compare the actual result with your prediction.
Common mistakes
Treating single assignment as punctuation to memorize instead of a Erlang behavior to reason about.
Ignoring recursive state until it appears in production data or a larger program.
Try it yourself
Change, predict, then run
Create a small Erlang example that demonstrates single assignment. Add a normal case and a boundary case, write down the expected result for each, then explain which Erlang rule produces that result. Lesson 3 should remain small enough to trace without guessing.
Open Erlang workspaceCheck your understanding
What is the best first step when working with single assignment?
- Identify the data and predict the result
- Add more abstraction immediately
- Ignore boundary cases
- Memorize punctuation only
Show answer
A clear input, operation, and predicted result create a testable mental model.