self_recursive_cycle_fail.adl
1 2 program test.alpha { 3 function fib(n: u8) -> u8 { 4 if n <= 1u8 { 5 return n; 6 } else { 7 return fib(n - 1u8) + fib(n - 2u8); 8 } 9 } 10 11 transition foo(n: u8) -> u8 { 12 if n <= 1u8 { 13 return n; 14 } else { 15 return foo(n - 1u8) + foo(n - 2u8); 16 } 17 } 18 }