# Landin SECD Stack Machine: Study Guide

Landin SECD Stack Machine shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Evaluate with a stack, environment, control list and dump, pushing closures for lambdas and restoring the dump after an application returns.

## Steps to say out loud

1. Restate the input and the exact ask, and nail down constraints and overflow.
2. Name the pattern (binary search on the answer, monotonic stack or deque, interval / interval-DP, string hashing, graph traversal, or shortest paths) and why a nested scan or naive search fails.
3. Code it, then trace a short example plus one empty or already-solved edge case.

## Complexity

The classic first abstract machine for lambda calculus; each instruction is constant time.

## Common mistake

Forgetting to save the current stack and environment on the dump before entering a function, which corrupts the caller.

## Practice tip

Time yourself: two minutes to explain, ten to code, three to test edges. Disclosure: I work on Linkjob AI. I also keep a practice cheat sheet at AI interview copilot.