Trees and languages

To conclude, boolean and list already exist in most of the functional programming language !

reduce [] (fun x s->x::s) s;;
s |> reduce [] (fun x s->x::s) |> List.map ((+) 1);;

10 - 10