there's an isomorphism, because bf is np complete, as is simply typed lc. simply speaking, bf can implement lc, and vice versa, which would proof the claim. E

there's an isomorphism, because bf is np complete, as is simply typed lc. simply speaking, bf can implement lc, and vice versa, which would proof the claim. Edit: the ugly bit is that IO is always an ugly hack and potentially makes the program indetermined and thus impossible to proof a priory. but one can probably prove that they are equivalently unprovable.