theory Ex3
imports "Parser"
begin

(* Example 3, identical to example 1 from Terms.thy *)

atom_decl name

ML {* val _ = recursive := false  *}
nominal_datatype trm0 =
  Var0 "name"
| App0 "trm0" "trm0"
| Lam0 x::"name" t::"trm0"          bind x in t
| Let0 p::"pat0" "trm0" t::"trm0"   bind "f0 p" in t
and pat0 =
  PN0
| PS0 "name"
| PD0 "pat0" "pat0"
binder
  f0::"pat0 \<Rightarrow> atom set"
where
  "f0 PN0 = {}"
| "f0 (PS0 x) = {atom x}"
| "f0 (PD0 p1 p2) = (f0 p1) \<union> (f0 p2)"

thm trm0_pat0.fv
thm trm0_pat0.eq_iff
thm trm0_pat0.bn
thm trm0_pat0.perm
thm trm0_pat0.induct
thm trm0_pat0.distinct
thm trm0_pat0.fv[simplified trm0_pat0.supp,no_vars]

end