Backtracking without recursion

speaker: Tom Verhoeff event: 15th IOI conference

discover backtracking naturally implement without recursion

• using self-application binary puzzle strategy combinators self-applied strategy

self-application lambda calculus, (\x (x x))(\x (x x)) closures as objects pass the object as an argument to itself