FA-11478 / Compiler transformation correctness / Member archive

Boolean simplification erases evaluation of an effectful left operand · case 03

Boolean simplification erases evaluation of an effectful left operand.

Member previewVariant 3 · 3 implementations · 6 checks per implementation

Case contract

Model lowering lhs AND false as [False, trace]; lhs is always evaluated and contributes its effect unless pure. Effect is pure, write or read; label identifies the operation.

Why this case matters

A deterministic miniature compiler-pass model; inputs are explicit IR facts, not a production compiler.

One recorded failure

Sample boundary fixture

This sample comes from the broken implementation of a controlled reproducer.

Boundary fixture	Actual	Expected	Outcome
write	`[false, []]`	`[false, [3]]`	Failed

MEMBER ARCHIVE

The complete case is available to members.

This record includes three runnable implementations, regression fixtures, execution results, and source hashes.

Member access is invitation-based. Sign in with your invited account to inspect the sources.