Bowman traps are a construct used primarily in logic and computer science to illustrate non-termination, fixed-point reasoning, and the limitations of certain evaluation strategies. A canonical bowman trap is a self-referential term designed so that any attempt to evaluate or normalize it leads to infinite regress or undefined behavior. Rather than representing a specific historical reference, the name functions as a pedagogical example in discussions of recursion, combinatory logic, and formal verification. This guide explains the mechanics of bowman traps, how they relate to fixed-point combinators, and why they matter for reasoning about programs and proofs.
