I recently attended my first lecture on structural induction and the professor stated that structural induction can be used to to prove that two programming languages are equivalent.I am new to structural induction, however from what i have read so far, structural induction is used to prove properties $P$ like arithmetic or boolean expression of a particular language are deterministic. But these deterministic properties allows to define determinacy of a particular language .How is structural induction used to prove that two languages are equivalent?
Program equivalence with Structural induction
proof techniques;induction;operational semantics