01_pure_arithmetic.md

Example 01 — Pure Arithmetic

Illustrative pure computation slice for the conservative native compilation corridor
FROG — Free Open Graphical Language

---

Overview

This example illustrates the smallest natural positive slice of the first native compilation corridor: a pure typed arithmetic graph.

---

Illustrative Shape

a ----\
       +--- add ---\
b ----/            +--- multiply_by_constant --- result
constant ----------/

---

Why this Example Matters

This example is:

• pure,
• typed,
• free of UI-runtime dependence,
• free of explicit state,
• naturally compatible with native compilation.

It is therefore the first natural illustrative slice for the positive native_cpu_llvm corridor.

---

Architectural Reading

• Expression: canonical typed graph structure
• Language: pure arithmetic meaning
• IR: primary arithmetic execution objects and ordinary connectivity
• Lowering: SSA-friendly or equivalent pure computation preparation
• Backend contract: explicit native-CPU-friendly computation handoff

---

Related Conformance Case

Conformance/valid/compiler/01_pure_arithmetic_is_consumable

---

Summary

This example is the illustrative mirror of the first positive compiler-corridor anchor.