Bounded Recursive Reasoning
Typed Execution Tree vs. Unbounded Loop
Typed Tree
Open Loop
‹ Step
Step ›
Pause
Reset
01 // ROOT SPECIFICATION
02 // SPLIT COMBINATOR
03 // PARALLEL MAP EVALUATION
04 // FILTER PREDICATE GATE
05 // REDUCE & TERMINATION
typed_ast
chunk_01
chunk_03
[REJECT/DROP]
[TASK] ROOT QUERY
[SPLIT] DECOMPOSE
[MAP] CHUNK A
[MAP] CHUNK B
[MAP] CHUNK C
[FILTER] PREDICATE GATE
[REDUCE] AGGREGATE
[OUTPUT] FINAL ANSWER
UNBOUNDED STACK / NON-DETERMINISTIC CYCLES
prompt_gen
retry_cycle_N
state_context_v∞
[UNBOUNDED?]
[PROMPT] INIT
[GENERATE] LLM
[EVAL] CHECK
[MUTATE] RETRY
HALT ?
System Ready
Stage: Full Execution Path
Hover or click any combinator node to inspect upstream specification flow and downstream reduce paths. Use controls above to step through bounded stages.