# Krivine Machine Weak Head: Explained

Krivine Machine Weak Head shows up often in coding rounds. Here is how I talk through it when the interviewer is watching.

## Key idea

Evaluate a lambda term with an environment and a stack of arguments, never reducing under lambda, which implements weak-head call-by-name.

## 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

Each beta-step is a constant-time pop/push of the argument stack.

## Common mistake

Reducing under a lambda, which computes more than weak-head normal form and can diverge on unused arguments.

## 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 Linkjob.