Nominal/Ex/ExLetMult.thy
author Cezary Kaliszyk <kaliszyk@in.tum.de>
Fri, 16 Apr 2010 11:09:32 +0200
changeset 1865 b71b838b0a75
parent 1773 c0eac04ae3b4
child 2057 232595afb82e
permissions -rw-r--r--
Finished proof in Lambda.thy

theory ExLetMult
imports "../Parser"
begin

atom_decl name

ML {* val _ = recursive := true *}
ML {* val _ = alpha_type := AlphaLst *}
ML {* val _ = cheat_equivp := true *}
nominal_datatype trm =
  Vr "name"
| Ap "trm" "trm"
| Lm x::"name" t::"trm" bind x in t
| Lt l::"lts" t::"trm" s::"trm" bind "bn l" in t, bind "bn l" in s
and lts =
  Lnil
| Lcons "name" "trm" "lts"
binder
  bn
where
  "bn Lnil = []"
| "bn (Lcons x t l) = (atom x) # (bn l)"

thm trm_lts.eq_iff
thm trm_lts.induct
thm trm_lts.fv[simplified trm_lts.supp]

end