1 type term = I | S | K | FA of (term * term)
3 let skomega = FA (FA (FA (S,I), I), FA (FA (S,I), I))
4 let test = FA (FA (K,I), skomega)
6 let reduce_one_step (t:term):term = match t with
9 | FA(FA(FA(S,a),b),c) -> FA(FA(a,c),FA(b,c))
12 let is_redex (t:term):bool = not (t = reduce_one_step t)
14 let rec reduce_eager (t:term):term = match t with
19 let t' = FA (reduce_eager a, reduce_eager b) in
20 if (is_redex t') then reduce_eager (reduce_one_step t')
23 let rec reduce_lazy (t:term):term = match t with
28 let t' = FA (reduce_lazy a, b) in
29 if (is_redex t') then reduce_lazy (reduce_one_step t')