(*************************************************************************)
(** * Decidability of Typechecking *)
(*************************************************************************)
(* Finally, we give another example of a proof that makes use of the renaming lemma. We show that determining whether a program type checks is decidable. *)

(** Equality on types is decidable *)
Lemma eq_typ_dec : forall (T T' : typ),
{ T = T' } + { T <> T' }.